./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c --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/weaver/popl20-more-array-sum2.wvr.c -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 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:17,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:17,085 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:33:17,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:17,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:17,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:17,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:17,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:17,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:17,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:17,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:17,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:17,116 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:17,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:17,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:17,116 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:17,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:17,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:17,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:17,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:17,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:17,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:17,117 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:17,117 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:17,118 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:17,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:17,118 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:17,118 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:17,118 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:17,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:17,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:17,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:17,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:17,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:17,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:17,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:17,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:17,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:17,119 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:17,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:17,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:17,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:17,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:17,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:17,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:17,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:17,120 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 -> 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 [2025-01-09 21:33:17,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:17,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:17,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:17,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:17,416 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:17,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-01-09 21:33:18,749 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b7af963b/94e86cb95cac4a04ac17541e90b57439/FLAGd37ad37a4 [2025-01-09 21:33:19,021 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:19,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-01-09 21:33:19,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b7af963b/94e86cb95cac4a04ac17541e90b57439/FLAGd37ad37a4 [2025-01-09 21:33:19,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b7af963b/94e86cb95cac4a04ac17541e90b57439 [2025-01-09 21:33:19,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:19,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:19,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:19,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:19,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:19,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:19" (1/1) ... [2025-01-09 21:33:19,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe29827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:19, skipping insertion in model container [2025-01-09 21:33:19,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:19" (1/1) ... [2025-01-09 21:33:19,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:19,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:19,559 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:19,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:19,617 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:19,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:19 WrapperNode [2025-01-09 21:33:19,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:19,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:19,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:19,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:19,626 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:33:19" (1/1) ... [2025-01-09 21:33:19,636 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:33:19" (1/1) ... [2025-01-09 21:33:19,676 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 373 [2025-01-09 21:33:19,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:19,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:19,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:19,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:19,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:19" (1/1) ... [2025-01-09 21:33:19,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:19" (1/1) ... [2025-01-09 21:33:19,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:19" (1/1) ... [2025-01-09 21:33:19,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:19" (1/1) ... [2025-01-09 21:33:19,723 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:19" (1/1) ... [2025-01-09 21:33:19,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:19" (1/1) ... [2025-01-09 21:33:19,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:19" (1/1) ... [2025-01-09 21:33:19,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:19" (1/1) ... [2025-01-09 21:33:19,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:19" (1/1) ... [2025-01-09 21:33:19,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:19,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:19,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:19,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:19,751 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:19" (1/1) ... [2025-01-09 21:33:19,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:19,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:19,789 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:33:19,796 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:33:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:19,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:19,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:19,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:19,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:19,822 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:33:19,925 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:19,927 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:20,543 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:20,544 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:20,974 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:20,974 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:33:20,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:20 BoogieIcfgContainer [2025-01-09 21:33:20,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:20,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:20,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:20,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:20,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:19" (1/3) ... [2025-01-09 21:33:20,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d6e502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:20, skipping insertion in model container [2025-01-09 21:33:20,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:19" (2/3) ... [2025-01-09 21:33:20,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d6e502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:20, skipping insertion in model container [2025-01-09 21:33:20,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:20" (3/3) ... [2025-01-09 21:33:20,985 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2025-01-09 21:33:21,001 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:21,002 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 267 locations, 1 initial locations, 5 loop locations, and 35 error locations. [2025-01-09 21:33:21,003 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:21,084 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:33:21,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 281 transitions, 583 flow [2025-01-09 21:33:21,262 INFO L124 PetriNetUnfolderBase]: 15/278 cut-off events. [2025-01-09 21:33:21,265 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:21,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 278 events. 15/278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 324 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 230. Up to 2 conditions per place. [2025-01-09 21:33:21,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 281 transitions, 583 flow [2025-01-09 21:33:21,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 261 transitions, 540 flow [2025-01-09 21:33:21,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:21,302 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;@14d58b1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:21,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-01-09 21:33:21,309 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:21,311 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-01-09 21:33:21,311 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:21,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:21,312 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] [2025-01-09 21:33:21,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:21,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:21,318 INFO L85 PathProgramCache]: Analyzing trace with hash 272515466, now seen corresponding path program 1 times [2025-01-09 21:33:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:21,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268182942] [2025-01-09 21:33:21,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:21,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:21,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:33:21,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:33:21,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:21,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:21,475 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:33:21,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:21,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268182942] [2025-01-09 21:33:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268182942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:21,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:21,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:21,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3150663] [2025-01-09 21:33:21,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:21,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:21,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:21,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:21,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:21,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 281 [2025-01-09 21:33:21,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 261 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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:33:21,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:21,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 281 [2025-01-09 21:33:21,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:21,731 INFO L124 PetriNetUnfolderBase]: 78/522 cut-off events. [2025-01-09 21:33:21,731 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-01-09 21:33:21,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 522 events. 78/522 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1970 event pairs, 38 based on Foata normal form. 37/482 useless extension candidates. Maximal degree in co-relation 446. Up to 113 conditions per place. [2025-01-09 21:33:21,741 INFO L140 encePairwiseOnDemand]: 252/281 looper letters, 16 selfloop transitions, 2 changer transitions 5/234 dead transitions. [2025-01-09 21:33:21,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 234 transitions, 522 flow [2025-01-09 21:33:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 744 transitions. [2025-01-09 21:33:21,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8825622775800712 [2025-01-09 21:33:21,766 INFO L175 Difference]: Start difference. First operand has 257 places, 261 transitions, 540 flow. Second operand 3 states and 744 transitions. [2025-01-09 21:33:21,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 234 transitions, 522 flow [2025-01-09 21:33:21,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 234 transitions, 510 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:33:21,779 INFO L231 Difference]: Finished difference. Result has 234 places, 229 transitions, 468 flow [2025-01-09 21:33:21,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=234, PETRI_TRANSITIONS=229} [2025-01-09 21:33:21,785 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -23 predicate places. [2025-01-09 21:33:21,787 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 229 transitions, 468 flow [2025-01-09 21:33:21,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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:33:21,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:21,788 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] [2025-01-09 21:33:21,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:21,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:21,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:21,790 INFO L85 PathProgramCache]: Analyzing trace with hash -642724384, now seen corresponding path program 1 times [2025-01-09 21:33:21,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:21,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312470775] [2025-01-09 21:33:21,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:21,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:21,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:33:21,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:33:21,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:21,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:21,862 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:33:21,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312470775] [2025-01-09 21:33:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312470775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:21,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:21,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354821898] [2025-01-09 21:33:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:21,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:21,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:21,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:21,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:21,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 281 [2025-01-09 21:33:21,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 229 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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:33:21,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:21,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 281 [2025-01-09 21:33:21,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:22,028 INFO L124 PetriNetUnfolderBase]: 51/397 cut-off events. [2025-01-09 21:33:22,029 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:33:22,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 397 events. 51/397 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1223 event pairs, 34 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 468. Up to 86 conditions per place. [2025-01-09 21:33:22,032 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 17 selfloop transitions, 2 changer transitions 0/228 dead transitions. [2025-01-09 21:33:22,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 228 transitions, 504 flow [2025-01-09 21:33:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2025-01-09 21:33:22,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8493475682087782 [2025-01-09 21:33:22,036 INFO L175 Difference]: Start difference. First operand has 234 places, 229 transitions, 468 flow. Second operand 3 states and 716 transitions. [2025-01-09 21:33:22,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 228 transitions, 504 flow [2025-01-09 21:33:22,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 228 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:22,044 INFO L231 Difference]: Finished difference. Result has 228 places, 228 transitions, 466 flow [2025-01-09 21:33:22,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=228, PETRI_TRANSITIONS=228} [2025-01-09 21:33:22,045 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -29 predicate places. [2025-01-09 21:33:22,046 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 228 transitions, 466 flow [2025-01-09 21:33:22,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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:33:22,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:22,046 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] [2025-01-09 21:33:22,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:22,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:22,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:22,049 INFO L85 PathProgramCache]: Analyzing trace with hash -654196550, now seen corresponding path program 1 times [2025-01-09 21:33:22,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:22,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92265511] [2025-01-09 21:33:22,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:22,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:22,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:33:22,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:33:22,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:22,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:22,143 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:33:22,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:22,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92265511] [2025-01-09 21:33:22,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92265511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:22,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:22,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:22,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805050201] [2025-01-09 21:33:22,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:22,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:22,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:22,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:22,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:22,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 281 [2025-01-09 21:33:22,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 228 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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:33:22,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:22,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 281 [2025-01-09 21:33:22,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:22,266 INFO L124 PetriNetUnfolderBase]: 84/465 cut-off events. [2025-01-09 21:33:22,267 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:33:22,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 465 events. 84/465 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1729 event pairs, 59 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 582. Up to 137 conditions per place. [2025-01-09 21:33:22,270 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 19 selfloop transitions, 1 changer transitions 0/223 dead transitions. [2025-01-09 21:33:22,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 223 transitions, 496 flow [2025-01-09 21:33:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2025-01-09 21:33:22,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8410438908659549 [2025-01-09 21:33:22,273 INFO L175 Difference]: Start difference. First operand has 228 places, 228 transitions, 466 flow. Second operand 3 states and 709 transitions. [2025-01-09 21:33:22,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 223 transitions, 496 flow [2025-01-09 21:33:22,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 223 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:22,277 INFO L231 Difference]: Finished difference. Result has 223 places, 223 transitions, 454 flow [2025-01-09 21:33:22,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=223, PETRI_TRANSITIONS=223} [2025-01-09 21:33:22,279 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -34 predicate places. [2025-01-09 21:33:22,279 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 223 transitions, 454 flow [2025-01-09 21:33:22,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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:33:22,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:22,280 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] [2025-01-09 21:33:22,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:22,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:22,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:22,281 INFO L85 PathProgramCache]: Analyzing trace with hash 13236547, now seen corresponding path program 1 times [2025-01-09 21:33:22,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:22,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239581096] [2025-01-09 21:33:22,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:22,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:33:22,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:33:22,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:22,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:22,379 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:33:22,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:22,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239581096] [2025-01-09 21:33:22,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239581096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:22,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:22,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:22,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018978756] [2025-01-09 21:33:22,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:22,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:22,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:22,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:22,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:22,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 281 [2025-01-09 21:33:22,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 223 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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:33:22,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:22,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 281 [2025-01-09 21:33:22,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:22,492 INFO L124 PetriNetUnfolderBase]: 33/333 cut-off events. [2025-01-09 21:33:22,493 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:22,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 333 events. 33/333 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 796 event pairs, 15 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 356. Up to 50 conditions per place. [2025-01-09 21:33:22,496 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 12 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-01-09 21:33:22,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 222 transitions, 480 flow [2025-01-09 21:33:22,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2025-01-09 21:33:22,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8612099644128114 [2025-01-09 21:33:22,499 INFO L175 Difference]: Start difference. First operand has 223 places, 223 transitions, 454 flow. Second operand 3 states and 726 transitions. [2025-01-09 21:33:22,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 222 transitions, 480 flow [2025-01-09 21:33:22,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 222 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:22,504 INFO L231 Difference]: Finished difference. Result has 223 places, 222 transitions, 455 flow [2025-01-09 21:33:22,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=223, PETRI_TRANSITIONS=222} [2025-01-09 21:33:22,505 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -34 predicate places. [2025-01-09 21:33:22,505 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 222 transitions, 455 flow [2025-01-09 21:33:22,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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:33:22,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:22,505 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] [2025-01-09 21:33:22,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:22,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:22,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:22,506 INFO L85 PathProgramCache]: Analyzing trace with hash -698832560, now seen corresponding path program 1 times [2025-01-09 21:33:22,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:22,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545484088] [2025-01-09 21:33:22,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:22,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:22,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:33:22,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:33:22,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:22,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:23,091 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:33:23,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:23,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545484088] [2025-01-09 21:33:23,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545484088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:23,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:23,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:23,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752386566] [2025-01-09 21:33:23,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:23,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:23,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:23,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:23,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:23,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 281 [2025-01-09 21:33:23,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 222 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 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:33:23,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:23,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 281 [2025-01-09 21:33:23,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:23,452 INFO L124 PetriNetUnfolderBase]: 33/331 cut-off events. [2025-01-09 21:33:23,452 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:23,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 331 events. 33/331 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 788 event pairs, 15 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 378. Up to 63 conditions per place. [2025-01-09 21:33:23,457 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 25 selfloop transitions, 10 changer transitions 0/220 dead transitions. [2025-01-09 21:33:23,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 220 transitions, 521 flow [2025-01-09 21:33:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1333 transitions. [2025-01-09 21:33:23,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7906287069988137 [2025-01-09 21:33:23,465 INFO L175 Difference]: Start difference. First operand has 223 places, 222 transitions, 455 flow. Second operand 6 states and 1333 transitions. [2025-01-09 21:33:23,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 220 transitions, 521 flow [2025-01-09 21:33:23,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 220 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:23,470 INFO L231 Difference]: Finished difference. Result has 224 places, 220 transitions, 467 flow [2025-01-09 21:33:23,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=467, PETRI_PLACES=224, PETRI_TRANSITIONS=220} [2025-01-09 21:33:23,471 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -33 predicate places. [2025-01-09 21:33:23,472 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 220 transitions, 467 flow [2025-01-09 21:33:23,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 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:33:23,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:23,473 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, 1, 1, 1, 1, 1, 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:33:23,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:23,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:23,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:23,475 INFO L85 PathProgramCache]: Analyzing trace with hash 389965875, now seen corresponding path program 1 times [2025-01-09 21:33:23,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:23,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502995563] [2025-01-09 21:33:23,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:23,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:23,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:33:23,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:33:23,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:23,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:23,565 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:33:23,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:23,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502995563] [2025-01-09 21:33:23,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502995563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:23,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:23,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:23,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100870042] [2025-01-09 21:33:23,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:23,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:23,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:23,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:23,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:23,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 281 [2025-01-09 21:33:23,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 220 transitions, 467 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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:33:23,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:23,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 281 [2025-01-09 21:33:23,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:23,662 INFO L124 PetriNetUnfolderBase]: 33/330 cut-off events. [2025-01-09 21:33:23,662 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:23,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 330 events. 33/330 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 784 event pairs, 15 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 369. Up to 50 conditions per place. [2025-01-09 21:33:23,664 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 12 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2025-01-09 21:33:23,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 219 transitions, 493 flow [2025-01-09 21:33:23,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2025-01-09 21:33:23,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8612099644128114 [2025-01-09 21:33:23,666 INFO L175 Difference]: Start difference. First operand has 224 places, 220 transitions, 467 flow. Second operand 3 states and 726 transitions. [2025-01-09 21:33:23,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 219 transitions, 493 flow [2025-01-09 21:33:23,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 219 transitions, 473 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:23,670 INFO L231 Difference]: Finished difference. Result has 220 places, 219 transitions, 449 flow [2025-01-09 21:33:23,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=449, PETRI_PLACES=220, PETRI_TRANSITIONS=219} [2025-01-09 21:33:23,671 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -37 predicate places. [2025-01-09 21:33:23,671 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 219 transitions, 449 flow [2025-01-09 21:33:23,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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:33:23,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:23,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:23,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:23,673 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:23,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:23,673 INFO L85 PathProgramCache]: Analyzing trace with hash 111394218, now seen corresponding path program 1 times [2025-01-09 21:33:23,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:23,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848231556] [2025-01-09 21:33:23,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:23,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:23,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 21:33:23,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 21:33:23,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:23,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:23,738 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:33:23,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:23,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848231556] [2025-01-09 21:33:23,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848231556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:23,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:23,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300294189] [2025-01-09 21:33:23,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:23,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:23,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:23,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:23,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:23,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 281 [2025-01-09 21:33:23,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 219 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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:33:23,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:23,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 281 [2025-01-09 21:33:23,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:23,884 INFO L124 PetriNetUnfolderBase]: 138/605 cut-off events. [2025-01-09 21:33:23,884 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-01-09 21:33:23,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 605 events. 138/605 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2629 event pairs, 71 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 771. Up to 187 conditions per place. [2025-01-09 21:33:23,888 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 17 selfloop transitions, 1 changer transitions 0/215 dead transitions. [2025-01-09 21:33:23,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 215 transitions, 477 flow [2025-01-09 21:33:23,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2025-01-09 21:33:23,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8481613285883749 [2025-01-09 21:33:23,892 INFO L175 Difference]: Start difference. First operand has 220 places, 219 transitions, 449 flow. Second operand 3 states and 715 transitions. [2025-01-09 21:33:23,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 215 transitions, 477 flow [2025-01-09 21:33:23,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 215 transitions, 473 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:23,896 INFO L231 Difference]: Finished difference. Result has 216 places, 215 transitions, 439 flow [2025-01-09 21:33:23,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=439, PETRI_PLACES=216, PETRI_TRANSITIONS=215} [2025-01-09 21:33:23,899 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -41 predicate places. [2025-01-09 21:33:23,899 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 215 transitions, 439 flow [2025-01-09 21:33:23,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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:33:23,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:23,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:23,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:23,900 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:23,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:23,902 INFO L85 PathProgramCache]: Analyzing trace with hash 836447247, now seen corresponding path program 1 times [2025-01-09 21:33:23,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:23,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839973614] [2025-01-09 21:33:23,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:23,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:23,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 21:33:23,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 21:33:23,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:23,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:23,998 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:33:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:23,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839973614] [2025-01-09 21:33:23,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839973614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:23,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:23,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:23,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903329935] [2025-01-09 21:33:23,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:23,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:24,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:24,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:24,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:24,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 281 [2025-01-09 21:33:24,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 215 transitions, 439 flow. Second operand has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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:33:24,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:24,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 281 [2025-01-09 21:33:24,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:24,088 INFO L124 PetriNetUnfolderBase]: 33/323 cut-off events. [2025-01-09 21:33:24,089 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:24,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 323 events. 33/323 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 742 event pairs, 15 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 345. Up to 47 conditions per place. [2025-01-09 21:33:24,091 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 10 selfloop transitions, 1 changer transitions 0/214 dead transitions. [2025-01-09 21:33:24,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 214 transitions, 459 flow [2025-01-09 21:33:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 735 transitions. [2025-01-09 21:33:24,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8718861209964412 [2025-01-09 21:33:24,094 INFO L175 Difference]: Start difference. First operand has 216 places, 215 transitions, 439 flow. Second operand 3 states and 735 transitions. [2025-01-09 21:33:24,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 214 transitions, 459 flow [2025-01-09 21:33:24,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 214 transitions, 458 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:24,098 INFO L231 Difference]: Finished difference. Result has 216 places, 214 transitions, 438 flow [2025-01-09 21:33:24,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=216, PETRI_TRANSITIONS=214} [2025-01-09 21:33:24,101 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -41 predicate places. [2025-01-09 21:33:24,101 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 214 transitions, 438 flow [2025-01-09 21:33:24,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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:33:24,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:24,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:24,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:24,103 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:24,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:24,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1228730701, now seen corresponding path program 1 times [2025-01-09 21:33:24,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:24,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571956497] [2025-01-09 21:33:24,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:24,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:24,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 21:33:24,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 21:33:24,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:24,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:24,173 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:33:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:24,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571956497] [2025-01-09 21:33:24,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571956497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:24,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:24,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:24,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584769378] [2025-01-09 21:33:24,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:24,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:24,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:24,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:24,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:24,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 281 [2025-01-09 21:33:24,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 214 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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:33:24,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:24,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 281 [2025-01-09 21:33:24,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:24,241 INFO L124 PetriNetUnfolderBase]: 33/322 cut-off events. [2025-01-09 21:33:24,241 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:24,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 322 events. 33/322 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 742 event pairs, 15 based on Foata normal form. 1/310 useless extension candidates. Maximal degree in co-relation 374. Up to 47 conditions per place. [2025-01-09 21:33:24,243 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 0 selfloop transitions, 0 changer transitions 213/213 dead transitions. [2025-01-09 21:33:24,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 213 transitions, 456 flow [2025-01-09 21:33:24,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2025-01-09 21:33:24,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8706998813760379 [2025-01-09 21:33:24,245 INFO L175 Difference]: Start difference. First operand has 216 places, 214 transitions, 438 flow. Second operand 3 states and 734 transitions. [2025-01-09 21:33:24,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 213 transitions, 456 flow [2025-01-09 21:33:24,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 213 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:24,247 INFO L231 Difference]: Finished difference. Result has 216 places, 0 transitions, 0 flow [2025-01-09 21:33:24,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=216, PETRI_TRANSITIONS=0} [2025-01-09 21:33:24,248 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -41 predicate places. [2025-01-09 21:33:24,248 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 0 transitions, 0 flow [2025-01-09 21:33:24,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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:33:24,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (59 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (58 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (57 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (55 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (54 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (53 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (52 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (51 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (50 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (49 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (48 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (47 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (46 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (45 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (44 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (43 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (42 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (41 of 60 remaining) [2025-01-09 21:33:24,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (40 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (39 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (38 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (36 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (28 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (27 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (26 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (25 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 60 remaining) [2025-01-09 21:33:24,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (17 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (15 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (11 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (9 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (8 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (7 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (5 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 60 remaining) [2025-01-09 21:33:24,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 60 remaining) [2025-01-09 21:33:24,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:24,255 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:24,260 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:24,260 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:24,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:24 BasicIcfg [2025-01-09 21:33:24,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:24,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:24,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:24,267 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:24,268 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:20" (3/4) ... [2025-01-09 21:33:24,270 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:24,272 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:24,272 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:24,272 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:24,279 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-01-09 21:33:24,279 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:24,279 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:24,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:24,372 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:24,372 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:24,372 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:24,374 INFO L158 Benchmark]: Toolchain (without parser) took 5045.37ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 133.0MB in the beginning and 64.3MB in the end (delta: 68.7MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. [2025-01-09 21:33:24,374 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:24,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.17ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 119.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:24,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.83ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 117.0MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:24,376 INFO L158 Benchmark]: Boogie Preprocessor took 72.25ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 114.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:24,376 INFO L158 Benchmark]: RCFGBuilder took 1225.01ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 85.1MB in the end (delta: 29.1MB). Peak memory consumption was 82.3MB. Max. memory is 16.1GB. [2025-01-09 21:33:24,377 INFO L158 Benchmark]: TraceAbstraction took 3290.57ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 85.1MB in the beginning and 72.2MB in the end (delta: 12.8MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2025-01-09 21:33:24,377 INFO L158 Benchmark]: Witness Printer took 105.22ms. Allocated memory is still 209.7MB. Free memory was 72.2MB in the beginning and 64.3MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:24,379 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.17ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 119.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.83ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 117.0MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.25ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 114.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1225.01ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 85.1MB in the end (delta: 29.1MB). Peak memory consumption was 82.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3290.57ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 85.1MB in the beginning and 72.2MB in the end (delta: 12.8MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * Witness Printer took 105.22ms. Allocated memory is still 209.7MB. Free memory was 72.2MB in the beginning and 64.3MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 333 locations, 60 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 286 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 447 IncrementalHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 100 mSDtfsCounter, 447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 736 ConstructedInterpolants, 0 QuantifiedInterpolants, 867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:24,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE