./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:32:27,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:32:28,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:32:28,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:32:28,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:32:28,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:32:28,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:32:28,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:32:28,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:32:28,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:32:28,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:32:28,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:32:28,086 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:32:28,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:32:28,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:32:28,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:32:28,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:32:28,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:32:28,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:32:28,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:32:28,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:32:28,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:32:28,089 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:32:28,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:32:28,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:32:28,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:32:28,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:32:28,090 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:32:28,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:32:28,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:32:28,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:32:28,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:32:28,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:32:28,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:32:28,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:32:28,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:32:28,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:32:28,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:32:28,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:32:28,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:32:28,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:32:28,094 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 [2024-11-10 14:32:28,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:32:28,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:32:28,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:32:28,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:32:28,384 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:32:28,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2024-11-10 14:32:29,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:32:30,102 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:32:30,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2024-11-10 14:32:30,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26e1033d/e672243f21374b979761c85ee85db4fc/FLAGcb1bf8a25 [2024-11-10 14:32:30,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26e1033d/e672243f21374b979761c85ee85db4fc [2024-11-10 14:32:30,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:32:30,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:32:30,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:32:30,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:32:30,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:32:30,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:32:30" (1/1) ... [2024-11-10 14:32:30,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6906944b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30, skipping insertion in model container [2024-11-10 14:32:30,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:32:30" (1/1) ... [2024-11-10 14:32:30,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:32:30,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:32:30,610 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:32:30,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:32:30,705 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:32:30,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30 WrapperNode [2024-11-10 14:32:30,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:32:30,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:32:30,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:32:30,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:32:30,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30" (1/1) ... [2024-11-10 14:32:30,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30" (1/1) ... [2024-11-10 14:32:30,753 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 143 [2024-11-10 14:32:30,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:32:30,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:32:30,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:32:30,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:32:30,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30" (1/1) ... [2024-11-10 14:32:30,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30" (1/1) ... [2024-11-10 14:32:30,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30" (1/1) ... [2024-11-10 14:32:30,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30" (1/1) ... [2024-11-10 14:32:30,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30" (1/1) ... [2024-11-10 14:32:30,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30" (1/1) ... [2024-11-10 14:32:30,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30" (1/1) ... [2024-11-10 14:32:30,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30" (1/1) ... [2024-11-10 14:32:30,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:32:30,788 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:32:30,789 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:32:30,789 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:32:30,790 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30" (1/1) ... [2024-11-10 14:32:30,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:32:30,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:32:30,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:32:30,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:32:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:32:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:32:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:32:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:32:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:32:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 14:32:30,872 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 14:32:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:32:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:32:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:32:30,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:32:30,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:32:30,874 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:32:30,991 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:32:30,993 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:32:31,249 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-10 14:32:31,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-10 14:32:31,294 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:32:31,295 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:32:31,341 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:32:31,342 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:32:31,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:32:31 BoogieIcfgContainer [2024-11-10 14:32:31,342 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:32:31,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:32:31,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:32:31,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:32:31,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:32:30" (1/3) ... [2024-11-10 14:32:31,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23155c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:32:31, skipping insertion in model container [2024-11-10 14:32:31,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:30" (2/3) ... [2024-11-10 14:32:31,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23155c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:32:31, skipping insertion in model container [2024-11-10 14:32:31,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:32:31" (3/3) ... [2024-11-10 14:32:31,353 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2024-11-10 14:32:31,369 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:32:31,370 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-10 14:32:31,371 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:32:31,451 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:32:31,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 202 transitions, 411 flow [2024-11-10 14:32:31,584 INFO L124 PetriNetUnfolderBase]: 19/264 cut-off events. [2024-11-10 14:32:31,585 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:32:31,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 264 events. 19/264 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 657 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 144. Up to 4 conditions per place. [2024-11-10 14:32:31,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 202 transitions, 411 flow [2024-11-10 14:32:31,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 202 transitions, 411 flow [2024-11-10 14:32:31,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:31,639 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;@73a1ade6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:31,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-10 14:32:31,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:31,683 INFO L124 PetriNetUnfolderBase]: 1/105 cut-off events. [2024-11-10 14:32:31,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:31,684 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:31,684 INFO L204 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] [2024-11-10 14:32:31,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:31,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:31,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1059765664, now seen corresponding path program 1 times [2024-11-10 14:32:31,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:31,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541221468] [2024-11-10 14:32:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:31,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541221468] [2024-11-10 14:32:32,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541221468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:32,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:32,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:32,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593721989] [2024-11-10 14:32:32,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:32,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:32:32,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:32,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:32:32,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:32:32,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 202 [2024-11-10 14:32:32,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 202 transitions, 411 flow. Second operand has 2 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 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) [2024-11-10 14:32:32,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:32,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 202 [2024-11-10 14:32:32,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:32,183 INFO L124 PetriNetUnfolderBase]: 25/434 cut-off events. [2024-11-10 14:32:32,183 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:32:32,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 434 events. 25/434 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1525 event pairs, 24 based on Foata normal form. 72/470 useless extension candidates. Maximal degree in co-relation 350. Up to 65 conditions per place. [2024-11-10 14:32:32,188 INFO L140 encePairwiseOnDemand]: 190/202 looper letters, 12 selfloop transitions, 0 changer transitions 0/188 dead transitions. [2024-11-10 14:32:32,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 188 transitions, 407 flow [2024-11-10 14:32:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:32:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:32:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 378 transitions. [2024-11-10 14:32:32,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9356435643564357 [2024-11-10 14:32:32,208 INFO L175 Difference]: Start difference. First operand has 192 places, 202 transitions, 411 flow. Second operand 2 states and 378 transitions. [2024-11-10 14:32:32,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 188 transitions, 407 flow [2024-11-10 14:32:32,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 188 transitions, 407 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:32,219 INFO L231 Difference]: Finished difference. Result has 191 places, 188 transitions, 383 flow [2024-11-10 14:32:32,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=383, PETRI_PLACES=191, PETRI_TRANSITIONS=188} [2024-11-10 14:32:32,225 INFO L277 CegarLoopForPetriNet]: 192 programPoint places, -1 predicate places. [2024-11-10 14:32:32,225 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 188 transitions, 383 flow [2024-11-10 14:32:32,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 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) [2024-11-10 14:32:32,227 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:32,227 INFO L204 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] [2024-11-10 14:32:32,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:32:32,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:32,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:32,228 INFO L85 PathProgramCache]: Analyzing trace with hash -283951105, now seen corresponding path program 1 times [2024-11-10 14:32:32,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:32,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927209595] [2024-11-10 14:32:32,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:32,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:32,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:32,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927209595] [2024-11-10 14:32:32,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927209595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:32,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:32,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:32:32,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176253046] [2024-11-10 14:32:32,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:32,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:32,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:32,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:32,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:32,490 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 202 [2024-11-10 14:32:32,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 188 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 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) [2024-11-10 14:32:32,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:32,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 202 [2024-11-10 14:32:32,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:32,612 INFO L124 PetriNetUnfolderBase]: 48/607 cut-off events. [2024-11-10 14:32:32,613 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:32:32,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 607 events. 48/607 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2741 event pairs, 0 based on Foata normal form. 1/558 useless extension candidates. Maximal degree in co-relation 725. Up to 108 conditions per place. [2024-11-10 14:32:32,619 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 22 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2024-11-10 14:32:32,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 194 transitions, 443 flow [2024-11-10 14:32:32,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2024-11-10 14:32:32,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8877887788778878 [2024-11-10 14:32:32,626 INFO L175 Difference]: Start difference. First operand has 191 places, 188 transitions, 383 flow. Second operand 3 states and 538 transitions. [2024-11-10 14:32:32,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 194 transitions, 443 flow [2024-11-10 14:32:32,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 194 transitions, 443 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:32,633 INFO L231 Difference]: Finished difference. Result has 194 places, 188 transitions, 391 flow [2024-11-10 14:32:32,633 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=194, PETRI_TRANSITIONS=188} [2024-11-10 14:32:32,634 INFO L277 CegarLoopForPetriNet]: 192 programPoint places, 2 predicate places. [2024-11-10 14:32:32,634 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 188 transitions, 391 flow [2024-11-10 14:32:32,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 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) [2024-11-10 14:32:32,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:32,636 INFO L204 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] [2024-11-10 14:32:32,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:32:32,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:32,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:32,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1226089202, now seen corresponding path program 1 times [2024-11-10 14:32:32,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:32,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998429406] [2024-11-10 14:32:32,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:32,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:33,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:33,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998429406] [2024-11-10 14:32:33,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998429406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:33,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:33,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:33,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749805987] [2024-11-10 14:32:33,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:33,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:33,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:33,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:33,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:33,491 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 202 [2024-11-10 14:32:33,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 188 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 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) [2024-11-10 14:32:33,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:33,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 202 [2024-11-10 14:32:33,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:33,698 INFO L124 PetriNetUnfolderBase]: 108/744 cut-off events. [2024-11-10 14:32:33,698 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-10 14:32:33,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 744 events. 108/744 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4003 event pairs, 66 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 1021. Up to 181 conditions per place. [2024-11-10 14:32:33,705 INFO L140 encePairwiseOnDemand]: 196/202 looper letters, 48 selfloop transitions, 5 changer transitions 0/211 dead transitions. [2024-11-10 14:32:33,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 211 transitions, 543 flow [2024-11-10 14:32:33,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:32:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:32:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1008 transitions. [2024-11-10 14:32:33,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8316831683168316 [2024-11-10 14:32:33,708 INFO L175 Difference]: Start difference. First operand has 194 places, 188 transitions, 391 flow. Second operand 6 states and 1008 transitions. [2024-11-10 14:32:33,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 211 transitions, 543 flow [2024-11-10 14:32:33,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 211 transitions, 539 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:33,717 INFO L231 Difference]: Finished difference. Result has 196 places, 187 transitions, 395 flow [2024-11-10 14:32:33,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=395, PETRI_PLACES=196, PETRI_TRANSITIONS=187} [2024-11-10 14:32:33,719 INFO L277 CegarLoopForPetriNet]: 192 programPoint places, 4 predicate places. [2024-11-10 14:32:33,719 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 187 transitions, 395 flow [2024-11-10 14:32:33,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 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) [2024-11-10 14:32:33,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:33,721 INFO L204 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] [2024-11-10 14:32:33,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:32:33,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:33,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:33,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1742208202, now seen corresponding path program 1 times [2024-11-10 14:32:33,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:33,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121516105] [2024-11-10 14:32:33,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:33,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:33,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:33,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121516105] [2024-11-10 14:32:33,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121516105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:33,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:33,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:33,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439639435] [2024-11-10 14:32:33,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:33,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:33,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:33,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:33,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:33,810 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 202 [2024-11-10 14:32:33,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 187 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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) [2024-11-10 14:32:33,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:33,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 202 [2024-11-10 14:32:33,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:33,963 INFO L124 PetriNetUnfolderBase]: 91/871 cut-off events. [2024-11-10 14:32:33,963 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:32:33,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 871 events. 91/871 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4845 event pairs, 30 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 1102. Up to 125 conditions per place. [2024-11-10 14:32:33,968 INFO L140 encePairwiseOnDemand]: 193/202 looper letters, 30 selfloop transitions, 6 changer transitions 0/200 dead transitions. [2024-11-10 14:32:33,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 200 transitions, 496 flow [2024-11-10 14:32:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2024-11-10 14:32:33,970 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8861386138613861 [2024-11-10 14:32:33,970 INFO L175 Difference]: Start difference. First operand has 196 places, 187 transitions, 395 flow. Second operand 3 states and 537 transitions. [2024-11-10 14:32:33,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 200 transitions, 496 flow [2024-11-10 14:32:33,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 200 transitions, 486 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:32:33,974 INFO L231 Difference]: Finished difference. Result has 193 places, 189 transitions, 423 flow [2024-11-10 14:32:33,975 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=423, PETRI_PLACES=193, PETRI_TRANSITIONS=189} [2024-11-10 14:32:33,976 INFO L277 CegarLoopForPetriNet]: 192 programPoint places, 1 predicate places. [2024-11-10 14:32:33,976 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 189 transitions, 423 flow [2024-11-10 14:32:33,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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) [2024-11-10 14:32:33,977 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:33,977 INFO L204 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] [2024-11-10 14:32:33,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:32:33,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:33,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1566824048, now seen corresponding path program 1 times [2024-11-10 14:32:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257744881] [2024-11-10 14:32:33,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:34,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:34,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257744881] [2024-11-10 14:32:34,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257744881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:34,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:34,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:34,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157768921] [2024-11-10 14:32:34,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:34,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:34,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:34,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:34,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:34,074 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 202 [2024-11-10 14:32:34,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 189 transitions, 423 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:34,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:34,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 202 [2024-11-10 14:32:34,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:34,204 INFO L124 PetriNetUnfolderBase]: 94/878 cut-off events. [2024-11-10 14:32:34,205 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-10 14:32:34,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 878 events. 94/878 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4983 event pairs, 60 based on Foata normal form. 0/809 useless extension candidates. Maximal degree in co-relation 1206. Up to 189 conditions per place. [2024-11-10 14:32:34,209 INFO L140 encePairwiseOnDemand]: 197/202 looper letters, 27 selfloop transitions, 4 changer transitions 0/196 dead transitions. [2024-11-10 14:32:34,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 196 transitions, 503 flow [2024-11-10 14:32:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2024-11-10 14:32:34,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8795379537953796 [2024-11-10 14:32:34,212 INFO L175 Difference]: Start difference. First operand has 193 places, 189 transitions, 423 flow. Second operand 3 states and 533 transitions. [2024-11-10 14:32:34,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 196 transitions, 503 flow [2024-11-10 14:32:34,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 196 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:34,216 INFO L231 Difference]: Finished difference. Result has 195 places, 192 transitions, 443 flow [2024-11-10 14:32:34,217 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=195, PETRI_TRANSITIONS=192} [2024-11-10 14:32:34,217 INFO L277 CegarLoopForPetriNet]: 192 programPoint places, 3 predicate places. [2024-11-10 14:32:34,218 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 192 transitions, 443 flow [2024-11-10 14:32:34,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:34,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:34,219 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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] [2024-11-10 14:32:34,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:32:34,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:34,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash -167401203, now seen corresponding path program 1 times [2024-11-10 14:32:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:34,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389686694] [2024-11-10 14:32:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:34,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:34,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:32:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:34,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:32:34,315 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:32:34,316 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-10 14:32:34,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-10 14:32:34,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-10 14:32:34,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-10 14:32:34,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-10 14:32:34,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-10 14:32:34,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-10 14:32:34,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-10 14:32:34,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-10 14:32:34,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-10 14:32:34,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-10 14:32:34,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-10 14:32:34,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:32:34,320 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 14:32:34,323 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:32:34,323 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:32:34,353 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:32:34,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 253 transitions, 522 flow [2024-11-10 14:32:34,405 INFO L124 PetriNetUnfolderBase]: 34/406 cut-off events. [2024-11-10 14:32:34,407 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:32:34,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 406 events. 34/406 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1244 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 266. Up to 8 conditions per place. [2024-11-10 14:32:34,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 238 places, 253 transitions, 522 flow [2024-11-10 14:32:34,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 253 transitions, 522 flow [2024-11-10 14:32:34,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:34,420 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;@73a1ade6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:34,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-10 14:32:34,430 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:34,430 INFO L124 PetriNetUnfolderBase]: 1/105 cut-off events. [2024-11-10 14:32:34,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:34,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:34,430 INFO L204 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] [2024-11-10 14:32:34,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:34,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:34,431 INFO L85 PathProgramCache]: Analyzing trace with hash -34617283, now seen corresponding path program 1 times [2024-11-10 14:32:34,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:34,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510084488] [2024-11-10 14:32:34,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:34,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:34,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:34,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510084488] [2024-11-10 14:32:34,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510084488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:34,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:34,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:34,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921633589] [2024-11-10 14:32:34,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:34,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:32:34,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:34,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:32:34,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:32:34,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 253 [2024-11-10 14:32:34,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 253 transitions, 522 flow. Second operand has 2 states, 2 states have (on average 215.5) internal successors, (431), 2 states have internal predecessors, (431), 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) [2024-11-10 14:32:34,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:34,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 253 [2024-11-10 14:32:34,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:34,903 INFO L124 PetriNetUnfolderBase]: 418/2758 cut-off events. [2024-11-10 14:32:34,903 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-10 14:32:34,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 2758 events. 418/2758 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 22153 event pairs, 414 based on Foata normal form. 784/3273 useless extension candidates. Maximal degree in co-relation 2883. Up to 716 conditions per place. [2024-11-10 14:32:34,928 INFO L140 encePairwiseOnDemand]: 235/253 looper letters, 20 selfloop transitions, 0 changer transitions 0/233 dead transitions. [2024-11-10 14:32:34,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 233 transitions, 522 flow [2024-11-10 14:32:34,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:32:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:32:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 466 transitions. [2024-11-10 14:32:34,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9209486166007905 [2024-11-10 14:32:34,930 INFO L175 Difference]: Start difference. First operand has 238 places, 253 transitions, 522 flow. Second operand 2 states and 466 transitions. [2024-11-10 14:32:34,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 233 transitions, 522 flow [2024-11-10 14:32:34,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 233 transitions, 522 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:34,935 INFO L231 Difference]: Finished difference. Result has 237 places, 233 transitions, 482 flow [2024-11-10 14:32:34,935 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=482, PETRI_PLACES=237, PETRI_TRANSITIONS=233} [2024-11-10 14:32:34,937 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -1 predicate places. [2024-11-10 14:32:34,937 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 233 transitions, 482 flow [2024-11-10 14:32:34,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 215.5) internal successors, (431), 2 states have internal predecessors, (431), 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) [2024-11-10 14:32:34,938 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:34,938 INFO L204 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] [2024-11-10 14:32:34,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:32:34,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:34,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:34,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1430877887, now seen corresponding path program 1 times [2024-11-10 14:32:34,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:34,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855831063] [2024-11-10 14:32:34,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:34,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:35,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:35,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855831063] [2024-11-10 14:32:35,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855831063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:35,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:35,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:32:35,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480468691] [2024-11-10 14:32:35,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:35,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:35,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:35,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:35,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 253 [2024-11-10 14:32:35,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 233 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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) [2024-11-10 14:32:35,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:35,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 253 [2024-11-10 14:32:35,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:35,684 INFO L124 PetriNetUnfolderBase]: 788/4636 cut-off events. [2024-11-10 14:32:35,684 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-10 14:32:35,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5990 conditions, 4636 events. 788/4636 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 43562 event pairs, 703 based on Foata normal form. 1/4194 useless extension candidates. Maximal degree in co-relation 5985. Up to 1303 conditions per place. [2024-11-10 14:32:35,711 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 31 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2024-11-10 14:32:35,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 240 transitions, 562 flow [2024-11-10 14:32:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2024-11-10 14:32:35,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8669301712779973 [2024-11-10 14:32:35,714 INFO L175 Difference]: Start difference. First operand has 237 places, 233 transitions, 482 flow. Second operand 3 states and 658 transitions. [2024-11-10 14:32:35,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 240 transitions, 562 flow [2024-11-10 14:32:35,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 240 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:35,720 INFO L231 Difference]: Finished difference. Result has 240 places, 234 transitions, 494 flow [2024-11-10 14:32:35,721 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=240, PETRI_TRANSITIONS=234} [2024-11-10 14:32:35,722 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, 2 predicate places. [2024-11-10 14:32:35,722 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 234 transitions, 494 flow [2024-11-10 14:32:35,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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) [2024-11-10 14:32:35,723 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:35,723 INFO L204 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] [2024-11-10 14:32:35,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:32:35,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:35,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1448786641, now seen corresponding path program 1 times [2024-11-10 14:32:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:35,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264844744] [2024-11-10 14:32:35,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:36,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:36,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264844744] [2024-11-10 14:32:36,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264844744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:36,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:36,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:36,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121143758] [2024-11-10 14:32:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:36,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:36,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:36,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:36,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:36,378 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 253 [2024-11-10 14:32:36,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 234 transitions, 494 flow. Second operand has 6 states, 6 states have (on average 197.5) internal successors, (1185), 6 states have internal predecessors, (1185), 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) [2024-11-10 14:32:36,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:36,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 253 [2024-11-10 14:32:36,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:37,549 INFO L124 PetriNetUnfolderBase]: 1718/7036 cut-off events. [2024-11-10 14:32:37,549 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-11-10 14:32:37,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10007 conditions, 7036 events. 1718/7036 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 70352 event pairs, 760 based on Foata normal form. 0/6352 useless extension candidates. Maximal degree in co-relation 10000. Up to 2015 conditions per place. [2024-11-10 14:32:37,597 INFO L140 encePairwiseOnDemand]: 247/253 looper letters, 80 selfloop transitions, 6 changer transitions 0/281 dead transitions. [2024-11-10 14:32:37,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 281 transitions, 760 flow [2024-11-10 14:32:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:32:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:32:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1262 transitions. [2024-11-10 14:32:37,602 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8313570487483531 [2024-11-10 14:32:37,602 INFO L175 Difference]: Start difference. First operand has 240 places, 234 transitions, 494 flow. Second operand 6 states and 1262 transitions. [2024-11-10 14:32:37,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 281 transitions, 760 flow [2024-11-10 14:32:37,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 281 transitions, 758 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:32:37,609 INFO L231 Difference]: Finished difference. Result has 243 places, 233 transitions, 502 flow [2024-11-10 14:32:37,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=502, PETRI_PLACES=243, PETRI_TRANSITIONS=233} [2024-11-10 14:32:37,611 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, 5 predicate places. [2024-11-10 14:32:37,612 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 233 transitions, 502 flow [2024-11-10 14:32:37,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.5) internal successors, (1185), 6 states have internal predecessors, (1185), 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) [2024-11-10 14:32:37,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:37,613 INFO L204 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] [2024-11-10 14:32:37,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:32:37,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:37,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:37,614 INFO L85 PathProgramCache]: Analyzing trace with hash -310776874, now seen corresponding path program 1 times [2024-11-10 14:32:37,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:37,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455544020] [2024-11-10 14:32:37,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:37,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:37,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:37,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455544020] [2024-11-10 14:32:37,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455544020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:37,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:37,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:37,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016825821] [2024-11-10 14:32:37,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:37,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:37,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:37,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:37,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:37,718 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 253 [2024-11-10 14:32:37,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 233 transitions, 502 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) [2024-11-10 14:32:37,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:37,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 253 [2024-11-10 14:32:37,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:39,775 INFO L124 PetriNetUnfolderBase]: 3893/14986 cut-off events. [2024-11-10 14:32:39,775 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-11-10 14:32:39,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21538 conditions, 14986 events. 3893/14986 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 169182 event pairs, 1530 based on Foata normal form. 0/13414 useless extension candidates. Maximal degree in co-relation 21531. Up to 3516 conditions per place. [2024-11-10 14:32:39,999 INFO L140 encePairwiseOnDemand]: 234/253 looper letters, 58 selfloop transitions, 14 changer transitions 0/266 dead transitions. [2024-11-10 14:32:39,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 266 transitions, 723 flow [2024-11-10 14:32:40,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2024-11-10 14:32:40,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8722002635046113 [2024-11-10 14:32:40,002 INFO L175 Difference]: Start difference. First operand has 243 places, 233 transitions, 502 flow. Second operand 3 states and 662 transitions. [2024-11-10 14:32:40,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 266 transitions, 723 flow [2024-11-10 14:32:40,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 266 transitions, 711 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:32:40,008 INFO L231 Difference]: Finished difference. Result has 242 places, 247 transitions, 612 flow [2024-11-10 14:32:40,009 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=242, PETRI_TRANSITIONS=247} [2024-11-10 14:32:40,010 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, 4 predicate places. [2024-11-10 14:32:40,010 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 247 transitions, 612 flow [2024-11-10 14:32:40,010 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) [2024-11-10 14:32:40,011 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:40,011 INFO L204 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] [2024-11-10 14:32:40,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:32:40,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:40,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:40,013 INFO L85 PathProgramCache]: Analyzing trace with hash 763199649, now seen corresponding path program 1 times [2024-11-10 14:32:40,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:40,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043094869] [2024-11-10 14:32:40,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:40,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:40,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:40,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043094869] [2024-11-10 14:32:40,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043094869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:40,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:40,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:40,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958903413] [2024-11-10 14:32:40,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:40,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:40,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:40,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:40,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:40,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 253 [2024-11-10 14:32:40,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 247 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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) [2024-11-10 14:32:40,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:40,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 253 [2024-11-10 14:32:40,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:42,038 INFO L124 PetriNetUnfolderBase]: 4020/16995 cut-off events. [2024-11-10 14:32:42,038 INFO L125 PetriNetUnfolderBase]: For 4359/4544 co-relation queries the response was YES. [2024-11-10 14:32:42,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27684 conditions, 16995 events. 4020/16995 cut-off events. For 4359/4544 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 201117 event pairs, 2411 based on Foata normal form. 46/15490 useless extension candidates. Maximal degree in co-relation 27676. Up to 5498 conditions per place. [2024-11-10 14:32:42,147 INFO L140 encePairwiseOnDemand]: 244/253 looper letters, 52 selfloop transitions, 14 changer transitions 0/271 dead transitions. [2024-11-10 14:32:42,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 271 transitions, 830 flow [2024-11-10 14:32:42,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2024-11-10 14:32:42,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8642951251646904 [2024-11-10 14:32:42,150 INFO L175 Difference]: Start difference. First operand has 242 places, 247 transitions, 612 flow. Second operand 3 states and 656 transitions. [2024-11-10 14:32:42,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 271 transitions, 830 flow [2024-11-10 14:32:42,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 271 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:42,165 INFO L231 Difference]: Finished difference. Result has 244 places, 259 transitions, 710 flow [2024-11-10 14:32:42,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=244, PETRI_TRANSITIONS=259} [2024-11-10 14:32:42,168 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, 6 predicate places. [2024-11-10 14:32:42,169 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 259 transitions, 710 flow [2024-11-10 14:32:42,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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) [2024-11-10 14:32:42,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:42,170 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:42,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:32:42,171 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:42,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1993713108, now seen corresponding path program 1 times [2024-11-10 14:32:42,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:42,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996065773] [2024-11-10 14:32:42,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:42,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:42,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:42,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996065773] [2024-11-10 14:32:42,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996065773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:32:42,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499616384] [2024-11-10 14:32:42,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:42,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:32:42,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:32:42,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:32:42,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:32:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:42,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:32:42,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:32:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:42,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:32:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:42,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499616384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:32:42,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:32:42,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:32:42,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093141080] [2024-11-10 14:32:42,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:32:42,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:32:42,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:42,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:32:42,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:32:42,826 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 253 [2024-11-10 14:32:42,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 259 transitions, 710 flow. Second operand has 10 states, 10 states have (on average 207.5) internal successors, (2075), 10 states have internal predecessors, (2075), 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) [2024-11-10 14:32:42,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:42,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 253 [2024-11-10 14:32:42,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:43,458 INFO L124 PetriNetUnfolderBase]: 821/4414 cut-off events. [2024-11-10 14:32:43,458 INFO L125 PetriNetUnfolderBase]: For 727/778 co-relation queries the response was YES. [2024-11-10 14:32:43,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6699 conditions, 4414 events. 821/4414 cut-off events. For 727/778 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 42147 event pairs, 50 based on Foata normal form. 110/4216 useless extension candidates. Maximal degree in co-relation 6690. Up to 470 conditions per place. [2024-11-10 14:32:43,477 INFO L140 encePairwiseOnDemand]: 248/253 looper letters, 72 selfloop transitions, 7 changer transitions 0/264 dead transitions. [2024-11-10 14:32:43,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 264 transitions, 832 flow [2024-11-10 14:32:43,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:32:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 14:32:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1926 transitions. [2024-11-10 14:32:43,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8458498023715415 [2024-11-10 14:32:43,482 INFO L175 Difference]: Start difference. First operand has 244 places, 259 transitions, 710 flow. Second operand 9 states and 1926 transitions. [2024-11-10 14:32:43,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 264 transitions, 832 flow [2024-11-10 14:32:43,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 264 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:43,491 INFO L231 Difference]: Finished difference. Result has 205 places, 208 transitions, 556 flow [2024-11-10 14:32:43,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=556, PETRI_PLACES=205, PETRI_TRANSITIONS=208} [2024-11-10 14:32:43,492 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -33 predicate places. [2024-11-10 14:32:43,492 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 208 transitions, 556 flow [2024-11-10 14:32:43,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 207.5) internal successors, (2075), 10 states have internal predecessors, (2075), 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) [2024-11-10 14:32:43,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:43,494 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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, 1] [2024-11-10 14:32:43,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:32:43,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-10 14:32:43,696 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:43,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:43,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1070810942, now seen corresponding path program 1 times [2024-11-10 14:32:43,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:43,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147079021] [2024-11-10 14:32:43,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:43,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:32:43,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:43,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147079021] [2024-11-10 14:32:43,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147079021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:43,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:43,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:43,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319145548] [2024-11-10 14:32:43,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:43,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:43,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:43,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:43,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:43,796 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 253 [2024-11-10 14:32:43,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 208 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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) [2024-11-10 14:32:43,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:43,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 253 [2024-11-10 14:32:43,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:43,990 INFO L124 PetriNetUnfolderBase]: 260/1383 cut-off events. [2024-11-10 14:32:43,990 INFO L125 PetriNetUnfolderBase]: For 456/477 co-relation queries the response was YES. [2024-11-10 14:32:43,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2429 conditions, 1383 events. 260/1383 cut-off events. For 456/477 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 8996 event pairs, 132 based on Foata normal form. 7/1296 useless extension candidates. Maximal degree in co-relation 2420. Up to 459 conditions per place. [2024-11-10 14:32:44,002 INFO L140 encePairwiseOnDemand]: 245/253 looper letters, 42 selfloop transitions, 12 changer transitions 0/222 dead transitions. [2024-11-10 14:32:44,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 222 transitions, 708 flow [2024-11-10 14:32:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2024-11-10 14:32:44,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8458498023715415 [2024-11-10 14:32:44,005 INFO L175 Difference]: Start difference. First operand has 205 places, 208 transitions, 556 flow. Second operand 3 states and 642 transitions. [2024-11-10 14:32:44,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 222 transitions, 708 flow [2024-11-10 14:32:44,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 222 transitions, 693 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-10 14:32:44,011 INFO L231 Difference]: Finished difference. Result has 204 places, 216 transitions, 639 flow [2024-11-10 14:32:44,011 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=204, PETRI_TRANSITIONS=216} [2024-11-10 14:32:44,012 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -34 predicate places. [2024-11-10 14:32:44,012 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 216 transitions, 639 flow [2024-11-10 14:32:44,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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) [2024-11-10 14:32:44,013 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:44,013 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:44,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:32:44,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:44,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:44,014 INFO L85 PathProgramCache]: Analyzing trace with hash 930468881, now seen corresponding path program 1 times [2024-11-10 14:32:44,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:44,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601952322] [2024-11-10 14:32:44,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:44,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:44,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:44,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601952322] [2024-11-10 14:32:44,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601952322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:44,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:44,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:44,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168681088] [2024-11-10 14:32:44,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:44,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:44,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:44,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:44,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:44,105 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 253 [2024-11-10 14:32:44,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 216 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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) [2024-11-10 14:32:44,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:44,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 253 [2024-11-10 14:32:44,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:44,260 INFO L124 PetriNetUnfolderBase]: 291/1458 cut-off events. [2024-11-10 14:32:44,260 INFO L125 PetriNetUnfolderBase]: For 1123/1158 co-relation queries the response was YES. [2024-11-10 14:32:44,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2886 conditions, 1458 events. 291/1458 cut-off events. For 1123/1158 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9645 event pairs, 134 based on Foata normal form. 9/1389 useless extension candidates. Maximal degree in co-relation 2877. Up to 501 conditions per place. [2024-11-10 14:32:44,269 INFO L140 encePairwiseOnDemand]: 245/253 looper letters, 49 selfloop transitions, 12 changer transitions 0/231 dead transitions. [2024-11-10 14:32:44,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 231 transitions, 828 flow [2024-11-10 14:32:44,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 643 transitions. [2024-11-10 14:32:44,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.847167325428195 [2024-11-10 14:32:44,272 INFO L175 Difference]: Start difference. First operand has 204 places, 216 transitions, 639 flow. Second operand 3 states and 643 transitions. [2024-11-10 14:32:44,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 231 transitions, 828 flow [2024-11-10 14:32:44,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 231 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:44,280 INFO L231 Difference]: Finished difference. Result has 206 places, 224 transitions, 725 flow [2024-11-10 14:32:44,280 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=725, PETRI_PLACES=206, PETRI_TRANSITIONS=224} [2024-11-10 14:32:44,281 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2024-11-10 14:32:44,281 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 224 transitions, 725 flow [2024-11-10 14:32:44,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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) [2024-11-10 14:32:44,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:44,282 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-11-10 14:32:44,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:32:44,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:44,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:44,283 INFO L85 PathProgramCache]: Analyzing trace with hash -679708147, now seen corresponding path program 1 times [2024-11-10 14:32:44,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:44,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386336073] [2024-11-10 14:32:44,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:44,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:44,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:32:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:44,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:32:44,385 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:32:44,386 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-10 14:32:44,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-10 14:32:44,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-10 14:32:44,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-10 14:32:44,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-10 14:32:44,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-10 14:32:44,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-10 14:32:44,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-10 14:32:44,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-10 14:32:44,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-10 14:32:44,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-10 14:32:44,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-10 14:32:44,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-10 14:32:44,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-10 14:32:44,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-10 14:32:44,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-10 14:32:44,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:32:44,390 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:44,391 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:32:44,392 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:32:44,429 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:32:44,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 284 places, 304 transitions, 635 flow [2024-11-10 14:32:44,539 INFO L124 PetriNetUnfolderBase]: 54/595 cut-off events. [2024-11-10 14:32:44,540 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 14:32:44,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 595 events. 54/595 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2065 event pairs, 1 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 414. Up to 16 conditions per place. [2024-11-10 14:32:44,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 284 places, 304 transitions, 635 flow [2024-11-10 14:32:44,553 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 284 places, 304 transitions, 635 flow [2024-11-10 14:32:44,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:44,554 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;@73a1ade6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:44,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-10 14:32:44,564 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:44,565 INFO L124 PetriNetUnfolderBase]: 1/105 cut-off events. [2024-11-10 14:32:44,565 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:44,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:44,565 INFO L204 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] [2024-11-10 14:32:44,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:32:44,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1825299309, now seen corresponding path program 1 times [2024-11-10 14:32:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:44,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063193341] [2024-11-10 14:32:44,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:44,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:44,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:44,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063193341] [2024-11-10 14:32:44,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063193341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:44,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:44,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:44,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310538074] [2024-11-10 14:32:44,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:44,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:32:44,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:44,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:32:44,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:32:44,602 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 304 [2024-11-10 14:32:44,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 304 transitions, 635 flow. Second operand has 2 states, 2 states have (on average 252.5) internal successors, (505), 2 states have internal predecessors, (505), 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) [2024-11-10 14:32:44,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:44,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 304 [2024-11-10 14:32:44,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:47,355 INFO L124 PetriNetUnfolderBase]: 4829/21070 cut-off events. [2024-11-10 14:32:47,355 INFO L125 PetriNetUnfolderBase]: For 940/940 co-relation queries the response was YES. [2024-11-10 14:32:47,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28495 conditions, 21070 events. 4829/21070 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 253971 event pairs, 4795 based on Foata normal form. 7533/26615 useless extension candidates. Maximal degree in co-relation 23907. Up to 6995 conditions per place. [2024-11-10 14:32:47,601 INFO L140 encePairwiseOnDemand]: 280/304 looper letters, 28 selfloop transitions, 0 changer transitions 0/278 dead transitions. [2024-11-10 14:32:47,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 278 transitions, 639 flow [2024-11-10 14:32:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:32:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:32:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 554 transitions. [2024-11-10 14:32:47,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9111842105263158 [2024-11-10 14:32:47,603 INFO L175 Difference]: Start difference. First operand has 284 places, 304 transitions, 635 flow. Second operand 2 states and 554 transitions. [2024-11-10 14:32:47,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 278 transitions, 639 flow [2024-11-10 14:32:47,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 278 transitions, 639 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:47,609 INFO L231 Difference]: Finished difference. Result has 283 places, 278 transitions, 583 flow [2024-11-10 14:32:47,609 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=583, PETRI_PLACES=283, PETRI_TRANSITIONS=278} [2024-11-10 14:32:47,610 INFO L277 CegarLoopForPetriNet]: 284 programPoint places, -1 predicate places. [2024-11-10 14:32:47,610 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 278 transitions, 583 flow [2024-11-10 14:32:47,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 252.5) internal successors, (505), 2 states have internal predecessors, (505), 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) [2024-11-10 14:32:47,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:47,611 INFO L204 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] [2024-11-10 14:32:47,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:32:47,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:32:47,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1041249601, now seen corresponding path program 1 times [2024-11-10 14:32:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:47,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439288166] [2024-11-10 14:32:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:47,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:47,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:47,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439288166] [2024-11-10 14:32:47,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439288166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:47,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:47,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:32:47,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725358967] [2024-11-10 14:32:47,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:47,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:47,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:47,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:47,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:47,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 304 [2024-11-10 14:32:47,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 278 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 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) [2024-11-10 14:32:47,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:47,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 304 [2024-11-10 14:32:47,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:52,422 INFO L124 PetriNetUnfolderBase]: 8948/36804 cut-off events. [2024-11-10 14:32:52,423 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2024-11-10 14:32:52,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50043 conditions, 36804 events. 8948/36804 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 480011 event pairs, 8324 based on Foata normal form. 1/33358 useless extension candidates. Maximal degree in co-relation 50037. Up to 12802 conditions per place. [2024-11-10 14:32:52,638 INFO L140 encePairwiseOnDemand]: 301/304 looper letters, 39 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2024-11-10 14:32:52,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 285 transitions, 679 flow [2024-11-10 14:32:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 777 transitions. [2024-11-10 14:32:52,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8519736842105263 [2024-11-10 14:32:52,640 INFO L175 Difference]: Start difference. First operand has 283 places, 278 transitions, 583 flow. Second operand 3 states and 777 transitions. [2024-11-10 14:32:52,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 285 transitions, 679 flow [2024-11-10 14:32:52,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 285 transitions, 679 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:52,647 INFO L231 Difference]: Finished difference. Result has 286 places, 279 transitions, 595 flow [2024-11-10 14:32:52,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=286, PETRI_TRANSITIONS=279} [2024-11-10 14:32:52,648 INFO L277 CegarLoopForPetriNet]: 284 programPoint places, 2 predicate places. [2024-11-10 14:32:52,648 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 279 transitions, 595 flow [2024-11-10 14:32:52,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 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) [2024-11-10 14:32:52,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:52,649 INFO L204 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] [2024-11-10 14:32:52,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:32:52,649 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:32:52,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:52,650 INFO L85 PathProgramCache]: Analyzing trace with hash -775327137, now seen corresponding path program 1 times [2024-11-10 14:32:52,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:52,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360995660] [2024-11-10 14:32:52,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:52,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:52,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360995660] [2024-11-10 14:32:52,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360995660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:52,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742960651] [2024-11-10 14:32:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:52,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:52,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:52,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:52,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:53,046 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 304 [2024-11-10 14:32:53,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 279 transitions, 595 flow. Second operand has 6 states, 6 states have (on average 234.5) internal successors, (1407), 6 states have internal predecessors, (1407), 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) [2024-11-10 14:32:53,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:53,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 304 [2024-11-10 14:32:53,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:59,820 INFO L124 PetriNetUnfolderBase]: 19555/50780 cut-off events. [2024-11-10 14:32:59,821 INFO L125 PetriNetUnfolderBase]: For 1403/1403 co-relation queries the response was YES. [2024-11-10 14:32:59,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79941 conditions, 50780 events. 19555/50780 cut-off events. For 1403/1403 co-relation queries the response was YES. Maximal size of possible extension queue 1271. Compared 609213 event pairs, 2581 based on Foata normal form. 0/47651 useless extension candidates. Maximal degree in co-relation 79933. Up to 20048 conditions per place. [2024-11-10 14:33:00,103 INFO L140 encePairwiseOnDemand]: 298/304 looper letters, 112 selfloop transitions, 6 changer transitions 0/350 dead transitions. [2024-11-10 14:33:00,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 350 transitions, 973 flow [2024-11-10 14:33:00,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1516 transitions. [2024-11-10 14:33:00,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.831140350877193 [2024-11-10 14:33:00,107 INFO L175 Difference]: Start difference. First operand has 286 places, 279 transitions, 595 flow. Second operand 6 states and 1516 transitions. [2024-11-10 14:33:00,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 350 transitions, 973 flow [2024-11-10 14:33:00,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 350 transitions, 971 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:33:00,116 INFO L231 Difference]: Finished difference. Result has 289 places, 278 transitions, 603 flow [2024-11-10 14:33:00,116 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=603, PETRI_PLACES=289, PETRI_TRANSITIONS=278} [2024-11-10 14:33:00,116 INFO L277 CegarLoopForPetriNet]: 284 programPoint places, 5 predicate places. [2024-11-10 14:33:00,117 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 278 transitions, 603 flow [2024-11-10 14:33:00,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.5) internal successors, (1407), 6 states have internal predecessors, (1407), 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) [2024-11-10 14:33:00,117 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:00,118 INFO L204 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] [2024-11-10 14:33:00,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:33:00,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:00,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:00,118 INFO L85 PathProgramCache]: Analyzing trace with hash -106819241, now seen corresponding path program 1 times [2024-11-10 14:33:00,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:00,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441527808] [2024-11-10 14:33:00,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:00,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:00,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:00,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441527808] [2024-11-10 14:33:00,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441527808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:00,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:00,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:00,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219446086] [2024-11-10 14:33:00,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:00,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:00,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:00,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:00,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:00,206 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 304 [2024-11-10 14:33:00,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 278 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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) [2024-11-10 14:33:00,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:00,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 304 [2024-11-10 14:33:00,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand