./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:26:26,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:26:27,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:26:27,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:26:27,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:26:27,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:26:27,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:26:27,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:26:27,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:26:27,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:26:27,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:26:27,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:26:27,041 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:26:27,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:26:27,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:26:27,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:26:27,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:26:27,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:26:27,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:26:27,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:26:27,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:26:27,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:26:27,042 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:26:27,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:26:27,042 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:26:27,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:26:27,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:26:27,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:26:27,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:26:27,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:26:27,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:26:27,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:27,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:26:27,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:26:27,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:26:27,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:27,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:26:27,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:26:27,043 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:26:27,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:26:27,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:26:27,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:26:27,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:26:27,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:26:27,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:26:27,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:26:27,044 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 -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2025-01-09 21:26:27,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:26:27,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:26:27,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:26:27,266 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:26:27,266 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:26:27,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-01-09 21:26:28,415 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d66a997e9/fb217afc193d4f838f0d69eadfef6486/FLAG1d7e77c0d [2025-01-09 21:26:28,673 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:26:28,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-01-09 21:26:28,697 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d66a997e9/fb217afc193d4f838f0d69eadfef6486/FLAG1d7e77c0d [2025-01-09 21:26:28,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d66a997e9/fb217afc193d4f838f0d69eadfef6486 [2025-01-09 21:26:28,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:26:28,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:26:28,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:26:28,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:26:28,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:26:28,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:28" (1/1) ... [2025-01-09 21:26:28,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659b9ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:28, skipping insertion in model container [2025-01-09 21:26:28,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:28" (1/1) ... [2025-01-09 21:26:29,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:26:29,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:26:29,252 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:26:29,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:26:29,311 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:26:29,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29 WrapperNode [2025-01-09 21:26:29,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:26:29,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:26:29,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:26:29,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:26:29,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,341 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2025-01-09 21:26:29,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:26:29,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:26:29,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:26:29,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:26:29,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:26:29,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:26:29,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:26:29,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:26:29,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (1/1) ... [2025-01-09 21:26:29,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:29,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:26:29,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:26:29,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:26:29,414 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:26:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:26:29,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:26:29,415 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:26:29,499 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:26:29,500 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:26:29,712 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:26:29,712 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:26:29,733 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:26:29,735 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:26:29,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:29 BoogieIcfgContainer [2025-01-09 21:26:29,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:26:29,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:26:29,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:26:29,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:26:29,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:26:28" (1/3) ... [2025-01-09 21:26:29,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732ced10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:29, skipping insertion in model container [2025-01-09 21:26:29,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:29" (2/3) ... [2025-01-09 21:26:29,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732ced10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:29, skipping insertion in model container [2025-01-09 21:26:29,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:29" (3/3) ... [2025-01-09 21:26:29,744 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2025-01-09 21:26:29,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:26:29,757 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_02-simple_racefree.i that has 2 procedures, 184 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-01-09 21:26:29,758 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:26:29,814 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:26:29,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 195 transitions, 397 flow [2025-01-09 21:26:29,917 INFO L124 PetriNetUnfolderBase]: 15/252 cut-off events. [2025-01-09 21:26:29,919 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:26:29,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 252 events. 15/252 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 622 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 139. Up to 4 conditions per place. [2025-01-09 21:26:29,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 195 transitions, 397 flow [2025-01-09 21:26:29,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 195 transitions, 397 flow [2025-01-09 21:26:29,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:29,954 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;@616d0400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:29,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-09 21:26:29,999 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:29,999 INFO L124 PetriNetUnfolderBase]: 0/100 cut-off events. [2025-01-09 21:26:29,999 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:29,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:30,007 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] [2025-01-09 21:26:30,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:30,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash -3885678, now seen corresponding path program 1 times [2025-01-09 21:26:30,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:30,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433198962] [2025-01-09 21:26:30,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:30,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:30,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:26:30,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:26:30,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:30,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:30,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433198962] [2025-01-09 21:26:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433198962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:30,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:30,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:30,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565017852] [2025-01-09 21:26:30,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:30,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:30,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:30,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:30,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:30,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 195 [2025-01-09 21:26:30,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 195 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:30,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:30,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 195 [2025-01-09 21:26:30,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:30,474 INFO L124 PetriNetUnfolderBase]: 48/613 cut-off events. [2025-01-09 21:26:30,474 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:26:30,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 613 events. 48/613 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2733 event pairs, 35 based on Foata normal form. 55/612 useless extension candidates. Maximal degree in co-relation 607. Up to 108 conditions per place. [2025-01-09 21:26:30,479 INFO L140 encePairwiseOnDemand]: 182/195 looper letters, 22 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2025-01-09 21:26:30,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 189 transitions, 433 flow [2025-01-09 21:26:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2025-01-09 21:26:30,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9213675213675213 [2025-01-09 21:26:30,493 INFO L175 Difference]: Start difference. First operand has 187 places, 195 transitions, 397 flow. Second operand 3 states and 539 transitions. [2025-01-09 21:26:30,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 189 transitions, 433 flow [2025-01-09 21:26:30,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 189 transitions, 433 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:30,501 INFO L231 Difference]: Finished difference. Result has 188 places, 183 transitions, 381 flow [2025-01-09 21:26:30,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=188, PETRI_TRANSITIONS=183} [2025-01-09 21:26:30,506 INFO L279 CegarLoopForPetriNet]: 187 programPoint places, 1 predicate places. [2025-01-09 21:26:30,506 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 183 transitions, 381 flow [2025-01-09 21:26:30,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:30,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:30,507 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] [2025-01-09 21:26:30,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:26:30,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:30,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:30,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1162424117, now seen corresponding path program 1 times [2025-01-09 21:26:30,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:30,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077683538] [2025-01-09 21:26:30,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:30,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:30,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:26:30,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:26:30,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:30,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:31,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077683538] [2025-01-09 21:26:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077683538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:31,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:31,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:31,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308431626] [2025-01-09 21:26:31,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:31,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:31,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:31,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:31,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:31,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 195 [2025-01-09 21:26:31,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 183 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 155.5) internal successors, (933), 6 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:31,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:31,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 195 [2025-01-09 21:26:31,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:31,375 INFO L124 PetriNetUnfolderBase]: 108/723 cut-off events. [2025-01-09 21:26:31,376 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:26:31,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 723 events. 108/723 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3822 event pairs, 66 based on Foata normal form. 0/663 useless extension candidates. Maximal degree in co-relation 860. Up to 181 conditions per place. [2025-01-09 21:26:31,379 INFO L140 encePairwiseOnDemand]: 189/195 looper letters, 48 selfloop transitions, 5 changer transitions 0/206 dead transitions. [2025-01-09 21:26:31,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 206 transitions, 533 flow [2025-01-09 21:26:31,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 978 transitions. [2025-01-09 21:26:31,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8358974358974359 [2025-01-09 21:26:31,382 INFO L175 Difference]: Start difference. First operand has 188 places, 183 transitions, 381 flow. Second operand 6 states and 978 transitions. [2025-01-09 21:26:31,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 206 transitions, 533 flow [2025-01-09 21:26:31,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 206 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:31,385 INFO L231 Difference]: Finished difference. Result has 190 places, 182 transitions, 385 flow [2025-01-09 21:26:31,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=190, PETRI_TRANSITIONS=182} [2025-01-09 21:26:31,386 INFO L279 CegarLoopForPetriNet]: 187 programPoint places, 3 predicate places. [2025-01-09 21:26:31,386 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 182 transitions, 385 flow [2025-01-09 21:26:31,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.5) internal successors, (933), 6 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:31,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:31,387 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] [2025-01-09 21:26:31,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:26:31,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:31,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:31,388 INFO L85 PathProgramCache]: Analyzing trace with hash -985654609, now seen corresponding path program 1 times [2025-01-09 21:26:31,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:31,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28837400] [2025-01-09 21:26:31,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:31,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:31,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:26:31,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:26:31,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:31,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:31,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28837400] [2025-01-09 21:26:31,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28837400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:31,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:31,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:31,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147412633] [2025-01-09 21:26:31,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:31,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:31,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:31,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:31,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:31,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 195 [2025-01-09 21:26:31,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 182 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:31,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:31,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 195 [2025-01-09 21:26:31,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:31,579 INFO L124 PetriNetUnfolderBase]: 91/845 cut-off events. [2025-01-09 21:26:31,579 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:26:31,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 845 events. 91/845 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4708 event pairs, 30 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 962. Up to 125 conditions per place. [2025-01-09 21:26:31,582 INFO L140 encePairwiseOnDemand]: 186/195 looper letters, 30 selfloop transitions, 6 changer transitions 0/195 dead transitions. [2025-01-09 21:26:31,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 195 transitions, 486 flow [2025-01-09 21:26:31,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2025-01-09 21:26:31,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8923076923076924 [2025-01-09 21:26:31,584 INFO L175 Difference]: Start difference. First operand has 190 places, 182 transitions, 385 flow. Second operand 3 states and 522 transitions. [2025-01-09 21:26:31,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 195 transitions, 486 flow [2025-01-09 21:26:31,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 195 transitions, 476 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:26:31,588 INFO L231 Difference]: Finished difference. Result has 187 places, 184 transitions, 413 flow [2025-01-09 21:26:31,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=413, PETRI_PLACES=187, PETRI_TRANSITIONS=184} [2025-01-09 21:26:31,589 INFO L279 CegarLoopForPetriNet]: 187 programPoint places, 0 predicate places. [2025-01-09 21:26:31,589 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 184 transitions, 413 flow [2025-01-09 21:26:31,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:31,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:31,589 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] [2025-01-09 21:26:31,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:26:31,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:31,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:31,590 INFO L85 PathProgramCache]: Analyzing trace with hash 700518348, now seen corresponding path program 1 times [2025-01-09 21:26:31,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:31,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798448606] [2025-01-09 21:26:31,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:31,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:31,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 21:26:31,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 21:26:31,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:31,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:31,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:31,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798448606] [2025-01-09 21:26:31,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798448606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:31,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:31,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:31,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936060553] [2025-01-09 21:26:31,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:31,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:31,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:31,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:31,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:31,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 195 [2025-01-09 21:26:31,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 184 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:31,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:31,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 195 [2025-01-09 21:26:31,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:31,789 INFO L124 PetriNetUnfolderBase]: 94/847 cut-off events. [2025-01-09 21:26:31,789 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-01-09 21:26:31,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 847 events. 94/847 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4774 event pairs, 60 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 1062. Up to 189 conditions per place. [2025-01-09 21:26:31,792 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 27 selfloop transitions, 4 changer transitions 0/191 dead transitions. [2025-01-09 21:26:31,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 191 transitions, 493 flow [2025-01-09 21:26:31,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2025-01-09 21:26:31,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8854700854700854 [2025-01-09 21:26:31,794 INFO L175 Difference]: Start difference. First operand has 187 places, 184 transitions, 413 flow. Second operand 3 states and 518 transitions. [2025-01-09 21:26:31,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 191 transitions, 493 flow [2025-01-09 21:26:31,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 191 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:31,798 INFO L231 Difference]: Finished difference. Result has 189 places, 187 transitions, 433 flow [2025-01-09 21:26:31,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=189, PETRI_TRANSITIONS=187} [2025-01-09 21:26:31,799 INFO L279 CegarLoopForPetriNet]: 187 programPoint places, 2 predicate places. [2025-01-09 21:26:31,799 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 187 transitions, 433 flow [2025-01-09 21:26:31,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:31,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:31,800 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:31,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:26:31,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:31,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:31,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2000656176, now seen corresponding path program 1 times [2025-01-09 21:26:31,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:31,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680228353] [2025-01-09 21:26:31,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:31,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:31,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:26:31,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:26:31,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:31,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:31,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:26:31,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:26:31,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:26:31,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:31,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:31,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:26:31,896 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:26:31,897 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-01-09 21:26:31,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-01-09 21:26:31,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-01-09 21:26:31,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-01-09 21:26:31,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-01-09 21:26:31,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-01-09 21:26:31,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-01-09 21:26:31,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-01-09 21:26:31,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-01-09 21:26:31,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-01-09 21:26:31,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-01-09 21:26:31,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-01-09 21:26:31,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:26:31,900 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:26:31,902 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:26:31,902 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:26:31,928 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:26:31,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 244 transitions, 504 flow [2025-01-09 21:26:31,970 INFO L124 PetriNetUnfolderBase]: 27/385 cut-off events. [2025-01-09 21:26:31,970 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:26:31,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 385 events. 27/385 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1160 event pairs, 0 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 254. Up to 6 conditions per place. [2025-01-09 21:26:31,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 244 transitions, 504 flow [2025-01-09 21:26:31,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 244 transitions, 504 flow [2025-01-09 21:26:31,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:31,975 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;@616d0400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:31,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 21:26:31,981 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:31,981 INFO L124 PetriNetUnfolderBase]: 0/100 cut-off events. [2025-01-09 21:26:31,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:31,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:31,981 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] [2025-01-09 21:26:31,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:31,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:31,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1882631662, now seen corresponding path program 1 times [2025-01-09 21:26:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662871809] [2025-01-09 21:26:31,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:31,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:26:31,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:26:31,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:31,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:32,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:32,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662871809] [2025-01-09 21:26:32,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662871809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:32,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:32,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:32,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083007675] [2025-01-09 21:26:32,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:32,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:32,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:32,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:32,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:32,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 244 [2025-01-09 21:26:32,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 244 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:32,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:32,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 244 [2025-01-09 21:26:32,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:32,457 INFO L124 PetriNetUnfolderBase]: 788/4355 cut-off events. [2025-01-09 21:26:32,457 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-09 21:26:32,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5708 conditions, 4355 events. 788/4355 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 41203 event pairs, 348 based on Foata normal form. 693/4662 useless extension candidates. Maximal degree in co-relation 721. Up to 1303 conditions per place. [2025-01-09 21:26:32,478 INFO L140 encePairwiseOnDemand]: 225/244 looper letters, 31 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2025-01-09 21:26:32,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 233 transitions, 548 flow [2025-01-09 21:26:32,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2025-01-09 21:26:32,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9002732240437158 [2025-01-09 21:26:32,482 INFO L175 Difference]: Start difference. First operand has 231 places, 244 transitions, 504 flow. Second operand 3 states and 659 transitions. [2025-01-09 21:26:32,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 233 transitions, 548 flow [2025-01-09 21:26:32,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 233 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:32,486 INFO L231 Difference]: Finished difference. Result has 232 places, 227 transitions, 480 flow [2025-01-09 21:26:32,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=232, PETRI_TRANSITIONS=227} [2025-01-09 21:26:32,487 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 1 predicate places. [2025-01-09 21:26:32,488 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 227 transitions, 480 flow [2025-01-09 21:26:32,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:32,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:32,488 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] [2025-01-09 21:26:32,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:26:32,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:32,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:32,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1543924683, now seen corresponding path program 1 times [2025-01-09 21:26:32,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:32,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217468550] [2025-01-09 21:26:32,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:32,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:32,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:26:32,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:26:32,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:32,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:32,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:32,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217468550] [2025-01-09 21:26:32,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217468550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:32,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:32,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:32,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848228311] [2025-01-09 21:26:32,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:32,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:32,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:32,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:32,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:32,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 244 [2025-01-09 21:26:32,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 227 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:32,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:32,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 244 [2025-01-09 21:26:32,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:33,467 INFO L124 PetriNetUnfolderBase]: 1718/5999 cut-off events. [2025-01-09 21:26:33,468 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-01-09 21:26:33,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9011 conditions, 5999 events. 1718/5999 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 57224 event pairs, 168 based on Foata normal form. 0/5548 useless extension candidates. Maximal degree in co-relation 4233. Up to 2015 conditions per place. [2025-01-09 21:26:33,498 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 80 selfloop transitions, 6 changer transitions 0/274 dead transitions. [2025-01-09 21:26:33,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 274 transitions, 746 flow [2025-01-09 21:26:33,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1220 transitions. [2025-01-09 21:26:33,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-01-09 21:26:33,501 INFO L175 Difference]: Start difference. First operand has 232 places, 227 transitions, 480 flow. Second operand 6 states and 1220 transitions. [2025-01-09 21:26:33,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 274 transitions, 746 flow [2025-01-09 21:26:33,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 274 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:26:33,504 INFO L231 Difference]: Finished difference. Result has 235 places, 226 transitions, 488 flow [2025-01-09 21:26:33,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=235, PETRI_TRANSITIONS=226} [2025-01-09 21:26:33,505 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2025-01-09 21:26:33,505 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 226 transitions, 488 flow [2025-01-09 21:26:33,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:33,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:33,506 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] [2025-01-09 21:26:33,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:26:33,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:33,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:33,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1248315346, now seen corresponding path program 1 times [2025-01-09 21:26:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:33,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469832531] [2025-01-09 21:26:33,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:33,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:33,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:26:33,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:26:33,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:33,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:33,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:33,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469832531] [2025-01-09 21:26:33,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469832531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:33,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:33,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:33,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436162364] [2025-01-09 21:26:33,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:33,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:33,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:33,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:33,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:33,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 244 [2025-01-09 21:26:33,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 226 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:33,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:33,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 244 [2025-01-09 21:26:33,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:34,722 INFO L124 PetriNetUnfolderBase]: 3893/14653 cut-off events. [2025-01-09 21:26:34,723 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-01-09 21:26:34,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21204 conditions, 14653 events. 3893/14653 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 163932 event pairs, 1530 based on Foata normal form. 0/13110 useless extension candidates. Maximal degree in co-relation 20044. Up to 3516 conditions per place. [2025-01-09 21:26:34,787 INFO L140 encePairwiseOnDemand]: 225/244 looper letters, 58 selfloop transitions, 14 changer transitions 0/259 dead transitions. [2025-01-09 21:26:34,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 259 transitions, 709 flow [2025-01-09 21:26:34,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2025-01-09 21:26:34,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8756830601092896 [2025-01-09 21:26:34,789 INFO L175 Difference]: Start difference. First operand has 235 places, 226 transitions, 488 flow. Second operand 3 states and 641 transitions. [2025-01-09 21:26:34,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 259 transitions, 709 flow [2025-01-09 21:26:34,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 259 transitions, 697 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:26:34,840 INFO L231 Difference]: Finished difference. Result has 234 places, 240 transitions, 598 flow [2025-01-09 21:26:34,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=234, PETRI_TRANSITIONS=240} [2025-01-09 21:26:34,841 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 3 predicate places. [2025-01-09 21:26:34,841 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 240 transitions, 598 flow [2025-01-09 21:26:34,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:34,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:34,842 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] [2025-01-09 21:26:34,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:26:34,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:34,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1157112957, now seen corresponding path program 1 times [2025-01-09 21:26:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:34,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080796030] [2025-01-09 21:26:34,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:34,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 21:26:34,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 21:26:34,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:34,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:34,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:34,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080796030] [2025-01-09 21:26:34,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080796030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:34,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:34,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:34,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967858074] [2025-01-09 21:26:34,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:34,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:34,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:34,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:34,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:34,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 244 [2025-01-09 21:26:34,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 240 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:34,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:34,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 244 [2025-01-09 21:26:34,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:36,385 INFO L124 PetriNetUnfolderBase]: 4020/16506 cut-off events. [2025-01-09 21:26:36,386 INFO L125 PetriNetUnfolderBase]: For 4312/4481 co-relation queries the response was YES. [2025-01-09 21:26:36,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27194 conditions, 16506 events. 4020/16506 cut-off events. For 4312/4481 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 193720 event pairs, 2411 based on Foata normal form. 46/15009 useless extension candidates. Maximal degree in co-relation 13739. Up to 5498 conditions per place. [2025-01-09 21:26:36,455 INFO L140 encePairwiseOnDemand]: 235/244 looper letters, 52 selfloop transitions, 14 changer transitions 0/264 dead transitions. [2025-01-09 21:26:36,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 264 transitions, 816 flow [2025-01-09 21:26:36,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2025-01-09 21:26:36,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8674863387978142 [2025-01-09 21:26:36,457 INFO L175 Difference]: Start difference. First operand has 234 places, 240 transitions, 598 flow. Second operand 3 states and 635 transitions. [2025-01-09 21:26:36,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 264 transitions, 816 flow [2025-01-09 21:26:36,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 264 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:36,469 INFO L231 Difference]: Finished difference. Result has 236 places, 252 transitions, 696 flow [2025-01-09 21:26:36,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=236, PETRI_TRANSITIONS=252} [2025-01-09 21:26:36,470 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2025-01-09 21:26:36,470 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 252 transitions, 696 flow [2025-01-09 21:26:36,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:36,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:36,471 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] [2025-01-09 21:26:36,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:26:36,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:36,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:36,472 INFO L85 PathProgramCache]: Analyzing trace with hash 896777828, now seen corresponding path program 1 times [2025-01-09 21:26:36,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:36,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685366177] [2025-01-09 21:26:36,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:36,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:36,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:26:36,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:26:36,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:36,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:36,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:36,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685366177] [2025-01-09 21:26:36,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685366177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:36,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:36,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:36,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376844462] [2025-01-09 21:26:36,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:36,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:26:36,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:36,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:26:36,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:26:36,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 244 [2025-01-09 21:26:36,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 252 transitions, 696 flow. Second operand has 5 states, 5 states have (on average 201.4) internal successors, (1007), 5 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:36,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:36,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 244 [2025-01-09 21:26:36,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:38,113 INFO L124 PetriNetUnfolderBase]: 3202/18502 cut-off events. [2025-01-09 21:26:38,113 INFO L125 PetriNetUnfolderBase]: For 1757/2060 co-relation queries the response was YES. [2025-01-09 21:26:38,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26838 conditions, 18502 events. 3202/18502 cut-off events. For 1757/2060 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 239812 event pairs, 1337 based on Foata normal form. 22/16537 useless extension candidates. Maximal degree in co-relation 12138. Up to 3722 conditions per place. [2025-01-09 21:26:38,211 INFO L140 encePairwiseOnDemand]: 239/244 looper letters, 56 selfloop transitions, 5 changer transitions 0/284 dead transitions. [2025-01-09 21:26:38,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 284 transitions, 882 flow [2025-01-09 21:26:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1256 transitions. [2025-01-09 21:26:38,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2025-01-09 21:26:38,214 INFO L175 Difference]: Start difference. First operand has 236 places, 252 transitions, 696 flow. Second operand 6 states and 1256 transitions. [2025-01-09 21:26:38,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 284 transitions, 882 flow [2025-01-09 21:26:38,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 284 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:38,224 INFO L231 Difference]: Finished difference. Result has 242 places, 254 transitions, 694 flow [2025-01-09 21:26:38,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=242, PETRI_TRANSITIONS=254} [2025-01-09 21:26:38,225 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2025-01-09 21:26:38,225 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 254 transitions, 694 flow [2025-01-09 21:26:38,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 201.4) internal successors, (1007), 5 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:38,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:38,226 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:38,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:26:38,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:38,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:38,227 INFO L85 PathProgramCache]: Analyzing trace with hash 472121456, now seen corresponding path program 1 times [2025-01-09 21:26:38,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:38,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519997381] [2025-01-09 21:26:38,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:38,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:38,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 21:26:38,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 21:26:38,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:38,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:38,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:38,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519997381] [2025-01-09 21:26:38,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519997381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:38,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:38,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:38,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81659462] [2025-01-09 21:26:38,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:38,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:38,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:38,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:38,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:38,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 244 [2025-01-09 21:26:38,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 254 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:38,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:38,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 244 [2025-01-09 21:26:38,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:40,048 INFO L124 PetriNetUnfolderBase]: 4656/19970 cut-off events. [2025-01-09 21:26:40,048 INFO L125 PetriNetUnfolderBase]: For 5126/5328 co-relation queries the response was YES. [2025-01-09 21:26:40,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32495 conditions, 19970 events. 4656/19970 cut-off events. For 5126/5328 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 247720 event pairs, 2716 based on Foata normal form. 35/17947 useless extension candidates. Maximal degree in co-relation 32254. Up to 6266 conditions per place. [2025-01-09 21:26:40,140 INFO L140 encePairwiseOnDemand]: 235/244 looper letters, 59 selfloop transitions, 17 changer transitions 0/278 dead transitions. [2025-01-09 21:26:40,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 278 transitions, 929 flow [2025-01-09 21:26:40,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:40,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:40,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 634 transitions. [2025-01-09 21:26:40,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8661202185792349 [2025-01-09 21:26:40,142 INFO L175 Difference]: Start difference. First operand has 242 places, 254 transitions, 694 flow. Second operand 3 states and 634 transitions. [2025-01-09 21:26:40,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 278 transitions, 929 flow [2025-01-09 21:26:40,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 278 transitions, 923 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:40,146 INFO L231 Difference]: Finished difference. Result has 244 places, 267 transitions, 842 flow [2025-01-09 21:26:40,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=244, PETRI_TRANSITIONS=267} [2025-01-09 21:26:40,147 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 13 predicate places. [2025-01-09 21:26:40,147 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 267 transitions, 842 flow [2025-01-09 21:26:40,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:40,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:40,147 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] [2025-01-09 21:26:40,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:26:40,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:40,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:40,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1269655190, now seen corresponding path program 1 times [2025-01-09 21:26:40,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:40,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748638080] [2025-01-09 21:26:40,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:40,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:40,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 21:26:40,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 21:26:40,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:40,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:40,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:40,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748638080] [2025-01-09 21:26:40,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748638080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:40,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:40,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:40,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009933551] [2025-01-09 21:26:40,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:40,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:40,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:40,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:40,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:40,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 244 [2025-01-09 21:26:40,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 267 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:40,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:40,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 244 [2025-01-09 21:26:40,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:42,154 INFO L124 PetriNetUnfolderBase]: 5232/22480 cut-off events. [2025-01-09 21:26:42,154 INFO L125 PetriNetUnfolderBase]: For 12868/13320 co-relation queries the response was YES. [2025-01-09 21:26:42,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39688 conditions, 22480 events. 5232/22480 cut-off events. For 12868/13320 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 284402 event pairs, 2910 based on Foata normal form. 60/20243 useless extension candidates. Maximal degree in co-relation 39426. Up to 7048 conditions per place. [2025-01-09 21:26:42,283 INFO L140 encePairwiseOnDemand]: 235/244 looper letters, 71 selfloop transitions, 17 changer transitions 0/292 dead transitions. [2025-01-09 21:26:42,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 292 transitions, 1136 flow [2025-01-09 21:26:42,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2025-01-09 21:26:42,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8674863387978142 [2025-01-09 21:26:42,285 INFO L175 Difference]: Start difference. First operand has 244 places, 267 transitions, 842 flow. Second operand 3 states and 635 transitions. [2025-01-09 21:26:42,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 292 transitions, 1136 flow [2025-01-09 21:26:42,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 292 transitions, 1096 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:42,303 INFO L231 Difference]: Finished difference. Result has 246 places, 280 transitions, 984 flow [2025-01-09 21:26:42,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=984, PETRI_PLACES=246, PETRI_TRANSITIONS=280} [2025-01-09 21:26:42,303 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 15 predicate places. [2025-01-09 21:26:42,304 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 280 transitions, 984 flow [2025-01-09 21:26:42,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:42,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:42,304 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:42,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:26:42,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:42,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:42,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1278034722, now seen corresponding path program 1 times [2025-01-09 21:26:42,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:42,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424962985] [2025-01-09 21:26:42,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:42,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:42,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:26:42,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:26:42,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:42,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:42,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:26:42,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:26:42,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:26:42,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:42,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:42,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:26:42,348 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:26:42,349 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-09 21:26:42,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-01-09 21:26:42,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-01-09 21:26:42,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-01-09 21:26:42,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-01-09 21:26:42,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-01-09 21:26:42,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-01-09 21:26:42,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-01-09 21:26:42,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-01-09 21:26:42,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-01-09 21:26:42,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-01-09 21:26:42,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-01-09 21:26:42,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-01-09 21:26:42,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-01-09 21:26:42,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-01-09 21:26:42,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-01-09 21:26:42,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:26:42,350 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:42,351 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:26:42,351 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:26:42,371 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:26:42,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 293 transitions, 613 flow [2025-01-09 21:26:42,427 INFO L124 PetriNetUnfolderBase]: 42/561 cut-off events. [2025-01-09 21:26:42,428 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 21:26:42,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 561 events. 42/561 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1953 event pairs, 1 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 393. Up to 12 conditions per place. [2025-01-09 21:26:42,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 293 transitions, 613 flow [2025-01-09 21:26:42,433 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 293 transitions, 613 flow [2025-01-09 21:26:42,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:42,434 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;@616d0400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:42,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-09 21:26:42,439 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:42,439 INFO L124 PetriNetUnfolderBase]: 0/100 cut-off events. [2025-01-09 21:26:42,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:42,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:42,439 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] [2025-01-09 21:26:42,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:26:42,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:42,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1480715726, now seen corresponding path program 1 times [2025-01-09 21:26:42,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:42,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467826043] [2025-01-09 21:26:42,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:42,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:42,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:26:42,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:26:42,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:42,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:42,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:42,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467826043] [2025-01-09 21:26:42,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467826043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:42,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:42,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:42,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211523493] [2025-01-09 21:26:42,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:42,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:42,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:42,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:42,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:42,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 293 [2025-01-09 21:26:42,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 293 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:42,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:42,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 293 [2025-01-09 21:26:42,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:45,613 INFO L124 PetriNetUnfolderBase]: 8948/35495 cut-off events. [2025-01-09 21:26:45,613 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2025-01-09 21:26:45,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48733 conditions, 35495 events. 8948/35495 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 459275 event pairs, 8324 based on Foata normal form. 7119/39219 useless extension candidates. Maximal degree in co-relation 35558. Up to 12802 conditions per place. [2025-01-09 21:26:45,973 INFO L140 encePairwiseOnDemand]: 268/293 looper letters, 39 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-01-09 21:26:45,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 276 transitions, 661 flow [2025-01-09 21:26:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 778 transitions. [2025-01-09 21:26:45,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8850967007963595 [2025-01-09 21:26:45,979 INFO L175 Difference]: Start difference. First operand has 275 places, 293 transitions, 613 flow. Second operand 3 states and 778 transitions. [2025-01-09 21:26:45,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 276 transitions, 661 flow [2025-01-09 21:26:45,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 276 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:45,983 INFO L231 Difference]: Finished difference. Result has 276 places, 270 transitions, 577 flow [2025-01-09 21:26:45,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=276, PETRI_TRANSITIONS=270} [2025-01-09 21:26:45,985 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 1 predicate places. [2025-01-09 21:26:45,985 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 270 transitions, 577 flow [2025-01-09 21:26:45,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:45,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:45,985 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] [2025-01-09 21:26:45,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:26:45,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:26:45,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:45,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1238091915, now seen corresponding path program 1 times [2025-01-09 21:26:45,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:45,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825959660] [2025-01-09 21:26:45,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:45,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:45,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:26:46,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:26:46,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:46,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:46,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:46,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825959660] [2025-01-09 21:26:46,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825959660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:46,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:46,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763734618] [2025-01-09 21:26:46,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:46,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:46,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:46,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:46,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:46,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 293 [2025-01-09 21:26:46,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 270 transitions, 577 flow. Second operand has 6 states, 6 states have (on average 225.5) internal successors, (1353), 6 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:46,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:46,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 293 [2025-01-09 21:26:46,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:52,772 INFO L124 PetriNetUnfolderBase]: 19590/65821 cut-off events. [2025-01-09 21:26:52,772 INFO L125 PetriNetUnfolderBase]: For 1507/1507 co-relation queries the response was YES. [2025-01-09 21:26:52,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94746 conditions, 65821 events. 19590/65821 cut-off events. For 1507/1507 co-relation queries the response was YES. Maximal size of possible extension queue 1361. Compared 891125 event pairs, 7382 based on Foata normal form. 0/60166 useless extension candidates. Maximal degree in co-relation 89186. Up to 20118 conditions per place. [2025-01-09 21:26:53,127 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 112 selfloop transitions, 6 changer transitions 0/341 dead transitions. [2025-01-09 21:26:53,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 341 transitions, 955 flow [2025-01-09 21:26:53,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1462 transitions. [2025-01-09 21:26:53,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8316268486916951 [2025-01-09 21:26:53,129 INFO L175 Difference]: Start difference. First operand has 276 places, 270 transitions, 577 flow. Second operand 6 states and 1462 transitions. [2025-01-09 21:26:53,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 341 transitions, 955 flow [2025-01-09 21:26:53,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 341 transitions, 953 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:26:53,135 INFO L231 Difference]: Finished difference. Result has 279 places, 269 transitions, 585 flow [2025-01-09 21:26:53,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=585, PETRI_PLACES=279, PETRI_TRANSITIONS=269} [2025-01-09 21:26:53,136 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 4 predicate places. [2025-01-09 21:26:53,136 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 269 transitions, 585 flow [2025-01-09 21:26:53,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.5) internal successors, (1353), 6 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:53,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:53,137 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] [2025-01-09 21:26:53,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:26:53,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:26:53,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:53,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1018913254, now seen corresponding path program 1 times [2025-01-09 21:26:53,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:53,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884630139] [2025-01-09 21:26:53,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:53,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:53,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:26:53,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:26:53,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:53,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:53,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:53,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884630139] [2025-01-09 21:26:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884630139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:53,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:53,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:53,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44474343] [2025-01-09 21:26:53,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:53,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:53,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:53,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:53,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:53,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 293 [2025-01-09 21:26:53,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 269 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:53,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:53,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 293 [2025-01-09 21:26:53,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand