./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d 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_36-indirect_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 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:40:13,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:40:13,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:40:13,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:40:13,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:40:13,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:40:13,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:40:13,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:40:13,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:40:13,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:40:13,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:40:13,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:40:13,906 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:40:13,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:40:13,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:40:13,908 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:40:13,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:40:13,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:40:13,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:40:13,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:40:13,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:40:13,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:40:13,912 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:40:13,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:40:13,912 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:40:13,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:40:13,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:40:13,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:40:13,914 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:40:13,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:40:13,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:40:13,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:40:13,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:40:13,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:40:13,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:40:13,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:40:13,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:40:13,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:40:13,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:40:13,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:40:13,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:40:13,919 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 -> 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 [2024-11-16 23:40:14,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:40:14,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:40:14,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:40:14,202 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:40:14,202 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:40:14,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i [2024-11-16 23:40:15,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:40:15,986 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:40:15,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i [2024-11-16 23:40:16,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586507da3/31a4f5af85e2403dbac7880f42b212c6/FLAGf65bf8f92 [2024-11-16 23:40:16,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586507da3/31a4f5af85e2403dbac7880f42b212c6 [2024-11-16 23:40:16,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:40:16,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:40:16,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:40:16,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:40:16,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:40:16,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:40:16" (1/1) ... [2024-11-16 23:40:16,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65711cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16, skipping insertion in model container [2024-11-16 23:40:16,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:40:16" (1/1) ... [2024-11-16 23:40:16,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:40:16,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:40:16,558 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:40:16,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:40:16,677 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:40:16,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16 WrapperNode [2024-11-16 23:40:16,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:40:16,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:40:16,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:40:16,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:40:16,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16" (1/1) ... [2024-11-16 23:40:16,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16" (1/1) ... [2024-11-16 23:40:16,744 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2024-11-16 23:40:16,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:40:16,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:40:16,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:40:16,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:40:16,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16" (1/1) ... [2024-11-16 23:40:16,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16" (1/1) ... [2024-11-16 23:40:16,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16" (1/1) ... [2024-11-16 23:40:16,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16" (1/1) ... [2024-11-16 23:40:16,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16" (1/1) ... [2024-11-16 23:40:16,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16" (1/1) ... [2024-11-16 23:40:16,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16" (1/1) ... [2024-11-16 23:40:16,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16" (1/1) ... [2024-11-16 23:40:16,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:40:16,785 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:40:16,786 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:40:16,786 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:40:16,788 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16" (1/1) ... [2024-11-16 23:40:16,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:40:16,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:40:16,841 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-16 23:40:16,852 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-16 23:40:16,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:40:16,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:40:16,920 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 23:40:16,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:40:16,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 23:40:16,921 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-16 23:40:16,921 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-16 23:40:16,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:40:16,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:40:16,921 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 23:40:16,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:40:16,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:40:16,923 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:40:17,104 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:40:17,108 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:40:17,398 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-16 23:40:17,399 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-16 23:40:17,518 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:40:17,518 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:40:17,567 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:40:17,567 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:40:17,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:40:17 BoogieIcfgContainer [2024-11-16 23:40:17,568 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:40:17,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:40:17,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:40:17,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:40:17,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:40:16" (1/3) ... [2024-11-16 23:40:17,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d19c77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:40:17, skipping insertion in model container [2024-11-16 23:40:17,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:40:16" (2/3) ... [2024-11-16 23:40:17,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d19c77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:40:17, skipping insertion in model container [2024-11-16 23:40:17,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:40:17" (3/3) ... [2024-11-16 23:40:17,582 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_36-indirect_racefree.i [2024-11-16 23:40:17,598 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:40:17,598 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-16 23:40:17,598 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:40:17,709 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-16 23:40:17,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 194 transitions, 395 flow [2024-11-16 23:40:17,903 INFO L124 PetriNetUnfolderBase]: 19/264 cut-off events. [2024-11-16 23:40:17,904 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:40:17,915 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 9. Compared 820 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 144. Up to 4 conditions per place. [2024-11-16 23:40:17,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 194 transitions, 395 flow [2024-11-16 23:40:17,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 194 transitions, 395 flow [2024-11-16 23:40:17,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:40:17,952 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;@7c2dde7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:40:17,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-16 23:40:17,962 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:40:17,964 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-11-16 23:40:17,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:40:17,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:17,966 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] [2024-11-16 23:40:17,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:40:17,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1051543775, now seen corresponding path program 1 times [2024-11-16 23:40:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:17,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668874335] [2024-11-16 23:40:17,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:18,228 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-16 23:40:18,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:18,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668874335] [2024-11-16 23:40:18,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668874335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:18,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:18,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:40:18,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310655165] [2024-11-16 23:40:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:18,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:18,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:18,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:18,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:18,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 194 [2024-11-16 23:40:18,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 194 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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-16 23:40:18,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:18,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 194 [2024-11-16 23:40:18,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:18,460 INFO L124 PetriNetUnfolderBase]: 37/661 cut-off events. [2024-11-16 23:40:18,460 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:40:18,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 661 events. 37/661 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3014 event pairs, 36 based on Foata normal form. 84/681 useless extension candidates. Maximal degree in co-relation 634. Up to 97 conditions per place. [2024-11-16 23:40:18,469 INFO L140 encePairwiseOnDemand]: 179/194 looper letters, 18 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2024-11-16 23:40:18,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 179 transitions, 405 flow [2024-11-16 23:40:18,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2024-11-16 23:40:18,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8814432989690721 [2024-11-16 23:40:18,496 INFO L175 Difference]: Start difference. First operand has 184 places, 194 transitions, 395 flow. Second operand 3 states and 513 transitions. [2024-11-16 23:40:18,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 179 transitions, 405 flow [2024-11-16 23:40:18,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 179 transitions, 405 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:40:18,506 INFO L231 Difference]: Finished difference. Result has 183 places, 179 transitions, 369 flow [2024-11-16 23:40:18,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=183, PETRI_TRANSITIONS=179} [2024-11-16 23:40:18,513 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -1 predicate places. [2024-11-16 23:40:18,514 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 179 transitions, 369 flow [2024-11-16 23:40:18,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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-16 23:40:18,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:18,515 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] [2024-11-16 23:40:18,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:40:18,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:40:18,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:18,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1216246335, now seen corresponding path program 1 times [2024-11-16 23:40:18,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:18,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905638624] [2024-11-16 23:40:18,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:18,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:18,639 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-16 23:40:18,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:18,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905638624] [2024-11-16 23:40:18,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905638624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:18,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:18,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:40:18,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825122170] [2024-11-16 23:40:18,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:18,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:18,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:18,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:18,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:18,664 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2024-11-16 23:40:18,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 179 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-16 23:40:18,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:18,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2024-11-16 23:40:18,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:18,811 INFO L124 PetriNetUnfolderBase]: 37/658 cut-off events. [2024-11-16 23:40:18,812 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:40:18,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 658 events. 37/658 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3050 event pairs, 36 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 722. Up to 94 conditions per place. [2024-11-16 23:40:18,816 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 16 selfloop transitions, 1 changer transitions 0/177 dead transitions. [2024-11-16 23:40:18,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 177 transitions, 399 flow [2024-11-16 23:40:18,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2024-11-16 23:40:18,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8676975945017182 [2024-11-16 23:40:18,822 INFO L175 Difference]: Start difference. First operand has 183 places, 179 transitions, 369 flow. Second operand 3 states and 505 transitions. [2024-11-16 23:40:18,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 177 transitions, 399 flow [2024-11-16 23:40:18,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 177 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:40:18,827 INFO L231 Difference]: Finished difference. Result has 181 places, 177 transitions, 363 flow [2024-11-16 23:40:18,828 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=363, PETRI_PLACES=181, PETRI_TRANSITIONS=177} [2024-11-16 23:40:18,828 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -3 predicate places. [2024-11-16 23:40:18,829 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 177 transitions, 363 flow [2024-11-16 23:40:18,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-16 23:40:18,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:18,830 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] [2024-11-16 23:40:18,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:40:18,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:40:18,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:18,832 INFO L85 PathProgramCache]: Analyzing trace with hash -586999227, now seen corresponding path program 1 times [2024-11-16 23:40:18,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:18,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694461795] [2024-11-16 23:40:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:18,915 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-16 23:40:18,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:18,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694461795] [2024-11-16 23:40:18,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694461795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:18,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:18,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:40:18,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34248844] [2024-11-16 23:40:18,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:18,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:18,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:18,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:18,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:18,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 194 [2024-11-16 23:40:18,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 177 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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-16 23:40:18,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:18,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 194 [2024-11-16 23:40:18,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:19,036 INFO L124 PetriNetUnfolderBase]: 41/597 cut-off events. [2024-11-16 23:40:19,037 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:40:19,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 597 events. 41/597 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2678 event pairs, 40 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 672. Up to 104 conditions per place. [2024-11-16 23:40:19,041 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 18 selfloop transitions, 2 changer transitions 0/176 dead transitions. [2024-11-16 23:40:19,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 176 transitions, 401 flow [2024-11-16 23:40:19,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2024-11-16 23:40:19,044 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8608247422680413 [2024-11-16 23:40:19,044 INFO L175 Difference]: Start difference. First operand has 181 places, 177 transitions, 363 flow. Second operand 3 states and 501 transitions. [2024-11-16 23:40:19,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 176 transitions, 401 flow [2024-11-16 23:40:19,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 176 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:40:19,048 INFO L231 Difference]: Finished difference. Result has 181 places, 176 transitions, 364 flow [2024-11-16 23:40:19,048 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=181, PETRI_TRANSITIONS=176} [2024-11-16 23:40:19,049 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -3 predicate places. [2024-11-16 23:40:19,049 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 364 flow [2024-11-16 23:40:19,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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-16 23:40:19,050 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:19,050 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] [2024-11-16 23:40:19,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:40:19,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:40:19,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:19,051 INFO L85 PathProgramCache]: Analyzing trace with hash -776567235, now seen corresponding path program 1 times [2024-11-16 23:40:19,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:19,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211563643] [2024-11-16 23:40:19,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:19,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:19,640 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-16 23:40:19,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:19,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211563643] [2024-11-16 23:40:19,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211563643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:19,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:19,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:40:19,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336939912] [2024-11-16 23:40:19,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:19,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:40:19,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:19,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:40:19,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:40:19,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 194 [2024-11-16 23:40:19,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 176 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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-16 23:40:19,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:19,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 194 [2024-11-16 23:40:19,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:20,533 INFO L124 PetriNetUnfolderBase]: 579/2278 cut-off events. [2024-11-16 23:40:20,534 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:40:20,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3540 conditions, 2278 events. 579/2278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 16136 event pairs, 343 based on Foata normal form. 0/2093 useless extension candidates. Maximal degree in co-relation 3502. Up to 1080 conditions per place. [2024-11-16 23:40:20,545 INFO L140 encePairwiseOnDemand]: 171/194 looper letters, 73 selfloop transitions, 70 changer transitions 0/269 dead transitions. [2024-11-16 23:40:20,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 269 transitions, 836 flow [2024-11-16 23:40:20,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:40:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:40:20,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 930 transitions. [2024-11-16 23:40:20,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7989690721649485 [2024-11-16 23:40:20,549 INFO L175 Difference]: Start difference. First operand has 181 places, 176 transitions, 364 flow. Second operand 6 states and 930 transitions. [2024-11-16 23:40:20,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 269 transitions, 836 flow [2024-11-16 23:40:20,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 269 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:40:20,557 INFO L231 Difference]: Finished difference. Result has 189 places, 245 transitions, 822 flow [2024-11-16 23:40:20,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=822, PETRI_PLACES=189, PETRI_TRANSITIONS=245} [2024-11-16 23:40:20,559 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 5 predicate places. [2024-11-16 23:40:20,559 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 245 transitions, 822 flow [2024-11-16 23:40:20,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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-16 23:40:20,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:20,560 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] [2024-11-16 23:40:20,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:40:20,561 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:40:20,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:20,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1009001231, now seen corresponding path program 1 times [2024-11-16 23:40:20,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:20,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197422876] [2024-11-16 23:40:20,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:20,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:20,633 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-16 23:40:20,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:20,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197422876] [2024-11-16 23:40:20,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197422876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:20,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:20,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:40:20,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933135206] [2024-11-16 23:40:20,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:20,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:20,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:20,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:20,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:20,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 194 [2024-11-16 23:40:20,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 245 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-16 23:40:20,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:20,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 194 [2024-11-16 23:40:20,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:20,834 INFO L124 PetriNetUnfolderBase]: 171/1219 cut-off events. [2024-11-16 23:40:20,835 INFO L125 PetriNetUnfolderBase]: For 119/136 co-relation queries the response was YES. [2024-11-16 23:40:20,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 1219 events. 171/1219 cut-off events. For 119/136 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7434 event pairs, 35 based on Foata normal form. 1/1134 useless extension candidates. Maximal degree in co-relation 1871. Up to 223 conditions per place. [2024-11-16 23:40:20,844 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 22 selfloop transitions, 3 changer transitions 0/251 dead transitions. [2024-11-16 23:40:20,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 251 transitions, 884 flow [2024-11-16 23:40:20,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2024-11-16 23:40:20,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8831615120274914 [2024-11-16 23:40:20,847 INFO L175 Difference]: Start difference. First operand has 189 places, 245 transitions, 822 flow. Second operand 3 states and 514 transitions. [2024-11-16 23:40:20,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 251 transitions, 884 flow [2024-11-16 23:40:20,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 251 transitions, 884 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:40:20,858 INFO L231 Difference]: Finished difference. Result has 192 places, 245 transitions, 833 flow [2024-11-16 23:40:20,859 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=833, PETRI_PLACES=192, PETRI_TRANSITIONS=245} [2024-11-16 23:40:20,860 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 8 predicate places. [2024-11-16 23:40:20,861 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 245 transitions, 833 flow [2024-11-16 23:40:20,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-16 23:40:20,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:20,862 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] [2024-11-16 23:40:20,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:40:20,863 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:40:20,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1367289087, now seen corresponding path program 1 times [2024-11-16 23:40:20,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:20,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062367186] [2024-11-16 23:40:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:20,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:20,944 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-16 23:40:20,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:20,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062367186] [2024-11-16 23:40:20,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062367186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:20,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:20,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:40:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104599131] [2024-11-16 23:40:20,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:20,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:20,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:20,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:20,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:20,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2024-11-16 23:40:20,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 245 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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-16 23:40:20,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:20,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2024-11-16 23:40:20,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:21,129 INFO L124 PetriNetUnfolderBase]: 165/1044 cut-off events. [2024-11-16 23:40:21,130 INFO L125 PetriNetUnfolderBase]: For 94/99 co-relation queries the response was YES. [2024-11-16 23:40:21,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 1044 events. 165/1044 cut-off events. For 94/99 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6046 event pairs, 8 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 1732. Up to 253 conditions per place. [2024-11-16 23:40:21,137 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 20 selfloop transitions, 1 changer transitions 0/247 dead transitions. [2024-11-16 23:40:21,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 247 transitions, 879 flow [2024-11-16 23:40:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2024-11-16 23:40:21,139 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8745704467353952 [2024-11-16 23:40:21,139 INFO L175 Difference]: Start difference. First operand has 192 places, 245 transitions, 833 flow. Second operand 3 states and 509 transitions. [2024-11-16 23:40:21,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 247 transitions, 879 flow [2024-11-16 23:40:21,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 247 transitions, 873 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:40:21,148 INFO L231 Difference]: Finished difference. Result has 190 places, 243 transitions, 825 flow [2024-11-16 23:40:21,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=825, PETRI_PLACES=190, PETRI_TRANSITIONS=243} [2024-11-16 23:40:21,150 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 6 predicate places. [2024-11-16 23:40:21,151 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 243 transitions, 825 flow [2024-11-16 23:40:21,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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-16 23:40:21,151 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:21,152 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] [2024-11-16 23:40:21,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:40:21,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:40:21,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:21,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1691698006, now seen corresponding path program 1 times [2024-11-16 23:40:21,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:21,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169839719] [2024-11-16 23:40:21,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:21,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:40:21,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:40:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:40:21,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:40:21,240 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:40:21,241 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2024-11-16 23:40:21,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-11-16 23:40:21,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-11-16 23:40:21,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-11-16 23:40:21,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-11-16 23:40:21,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2024-11-16 23:40:21,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-11-16 23:40:21,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-11-16 23:40:21,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-11-16 23:40:21,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-11-16 23:40:21,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-11-16 23:40:21,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-11-16 23:40:21,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-11-16 23:40:21,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-11-16 23:40:21,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-11-16 23:40:21,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-11-16 23:40:21,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-11-16 23:40:21,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-11-16 23:40:21,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-11-16 23:40:21,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-11-16 23:40:21,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:40:21,247 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:40:21,250 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:40:21,250 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 23:40:21,296 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 23:40:21,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 267 transitions, 550 flow [2024-11-16 23:40:21,350 INFO L124 PetriNetUnfolderBase]: 34/436 cut-off events. [2024-11-16 23:40:21,350 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:40:21,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 436 events. 34/436 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1670 event pairs, 0 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 266. Up to 8 conditions per place. [2024-11-16 23:40:21,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 252 places, 267 transitions, 550 flow [2024-11-16 23:40:21,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 267 transitions, 550 flow [2024-11-16 23:40:21,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:40:21,361 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;@7c2dde7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:40:21,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-16 23:40:21,364 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:40:21,364 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-11-16 23:40:21,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:40:21,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:21,365 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] [2024-11-16 23:40:21,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-16 23:40:21,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1674375052, now seen corresponding path program 1 times [2024-11-16 23:40:21,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:21,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429380653] [2024-11-16 23:40:21,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:21,389 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-16 23:40:21,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:21,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429380653] [2024-11-16 23:40:21,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429380653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:21,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:21,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:40:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427705242] [2024-11-16 23:40:21,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:21,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:21,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:21,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:21,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:21,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 267 [2024-11-16 23:40:21,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 267 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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-16 23:40:21,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:21,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 267 [2024-11-16 23:40:21,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:22,211 INFO L124 PetriNetUnfolderBase]: 610/5151 cut-off events. [2024-11-16 23:40:22,212 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-16 23:40:22,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6229 conditions, 5151 events. 610/5151 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 48434 event pairs, 600 based on Foata normal form. 962/5607 useless extension candidates. Maximal degree in co-relation 5267. Up to 1033 conditions per place. [2024-11-16 23:40:22,252 INFO L140 encePairwiseOnDemand]: 246/267 looper letters, 26 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2024-11-16 23:40:22,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 246 transitions, 564 flow [2024-11-16 23:40:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2024-11-16 23:40:22,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8789013732833958 [2024-11-16 23:40:22,255 INFO L175 Difference]: Start difference. First operand has 252 places, 267 transitions, 550 flow. Second operand 3 states and 704 transitions. [2024-11-16 23:40:22,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 246 transitions, 564 flow [2024-11-16 23:40:22,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 246 transitions, 564 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:40:22,259 INFO L231 Difference]: Finished difference. Result has 251 places, 246 transitions, 512 flow [2024-11-16 23:40:22,264 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=251, PETRI_TRANSITIONS=246} [2024-11-16 23:40:22,265 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, -1 predicate places. [2024-11-16 23:40:22,265 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 512 flow [2024-11-16 23:40:22,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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-16 23:40:22,266 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:22,266 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] [2024-11-16 23:40:22,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:40:22,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-16 23:40:22,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1538295604, now seen corresponding path program 1 times [2024-11-16 23:40:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:22,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361060232] [2024-11-16 23:40:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:22,293 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-16 23:40:22,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:22,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361060232] [2024-11-16 23:40:22,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361060232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:22,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:22,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:40:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424153894] [2024-11-16 23:40:22,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:22,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:22,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:22,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:22,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 267 [2024-11-16 23:40:22,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 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-16 23:40:22,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:22,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 267 [2024-11-16 23:40:22,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:23,174 INFO L124 PetriNetUnfolderBase]: 598/5083 cut-off events. [2024-11-16 23:40:23,174 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-16 23:40:23,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6142 conditions, 5083 events. 598/5083 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 47588 event pairs, 594 based on Foata normal form. 0/4598 useless extension candidates. Maximal degree in co-relation 6101. Up to 1011 conditions per place. [2024-11-16 23:40:23,216 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 24 selfloop transitions, 1 changer transitions 0/244 dead transitions. [2024-11-16 23:40:23,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 244 transitions, 558 flow [2024-11-16 23:40:23,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2024-11-16 23:40:23,219 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8614232209737828 [2024-11-16 23:40:23,219 INFO L175 Difference]: Start difference. First operand has 251 places, 246 transitions, 512 flow. Second operand 3 states and 690 transitions. [2024-11-16 23:40:23,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 244 transitions, 558 flow [2024-11-16 23:40:23,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 244 transitions, 554 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:40:23,223 INFO L231 Difference]: Finished difference. Result has 249 places, 244 transitions, 506 flow [2024-11-16 23:40:23,224 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=249, PETRI_TRANSITIONS=244} [2024-11-16 23:40:23,225 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, -3 predicate places. [2024-11-16 23:40:23,225 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 244 transitions, 506 flow [2024-11-16 23:40:23,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 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-16 23:40:23,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:23,225 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] [2024-11-16 23:40:23,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:40:23,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-16 23:40:23,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1946422640, now seen corresponding path program 1 times [2024-11-16 23:40:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:23,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434020223] [2024-11-16 23:40:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:23,249 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-16 23:40:23,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:23,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434020223] [2024-11-16 23:40:23,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434020223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:23,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:23,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:40:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087665032] [2024-11-16 23:40:23,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:23,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:23,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:23,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:23,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:23,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 267 [2024-11-16 23:40:23,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 244 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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-16 23:40:23,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:23,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 267 [2024-11-16 23:40:23,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:24,126 INFO L124 PetriNetUnfolderBase]: 868/5634 cut-off events. [2024-11-16 23:40:24,126 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-16 23:40:24,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7134 conditions, 5634 events. 868/5634 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 54068 event pairs, 856 based on Foata normal form. 0/5094 useless extension candidates. Maximal degree in co-relation 7095. Up to 1443 conditions per place. [2024-11-16 23:40:24,167 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 28 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2024-11-16 23:40:24,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 243 transitions, 564 flow [2024-11-16 23:40:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:24,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2024-11-16 23:40:24,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8514357053682896 [2024-11-16 23:40:24,170 INFO L175 Difference]: Start difference. First operand has 249 places, 244 transitions, 506 flow. Second operand 3 states and 682 transitions. [2024-11-16 23:40:24,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 243 transitions, 564 flow [2024-11-16 23:40:24,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 243 transitions, 563 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:40:24,175 INFO L231 Difference]: Finished difference. Result has 249 places, 243 transitions, 507 flow [2024-11-16 23:40:24,176 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=507, PETRI_PLACES=249, PETRI_TRANSITIONS=243} [2024-11-16 23:40:24,177 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, -3 predicate places. [2024-11-16 23:40:24,177 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 507 flow [2024-11-16 23:40:24,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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-16 23:40:24,178 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:24,178 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] [2024-11-16 23:40:24,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:40:24,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-16 23:40:24,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:24,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1592937987, now seen corresponding path program 1 times [2024-11-16 23:40:24,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:24,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296770754] [2024-11-16 23:40:24,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:24,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:24,501 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-16 23:40:24,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:24,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296770754] [2024-11-16 23:40:24,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296770754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:24,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:24,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:40:24,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845588266] [2024-11-16 23:40:24,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:24,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:40:24,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:24,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:40:24,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:40:24,766 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 267 [2024-11-16 23:40:24,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 243 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:40:24,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:24,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 267 [2024-11-16 23:40:24,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:32,837 INFO L124 PetriNetUnfolderBase]: 29150/69983 cut-off events. [2024-11-16 23:40:32,837 INFO L125 PetriNetUnfolderBase]: For 714/714 co-relation queries the response was YES. [2024-11-16 23:40:32,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115521 conditions, 69983 events. 29150/69983 cut-off events. For 714/714 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 790470 event pairs, 19147 based on Foata normal form. 0/65415 useless extension candidates. Maximal degree in co-relation 115482. Up to 40547 conditions per place. [2024-11-16 23:40:33,264 INFO L140 encePairwiseOnDemand]: 228/267 looper letters, 122 selfloop transitions, 134 changer transitions 0/425 dead transitions. [2024-11-16 23:40:33,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 425 transitions, 1388 flow [2024-11-16 23:40:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:40:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:40:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1301 transitions. [2024-11-16 23:40:33,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8121098626716604 [2024-11-16 23:40:33,268 INFO L175 Difference]: Start difference. First operand has 249 places, 243 transitions, 507 flow. Second operand 6 states and 1301 transitions. [2024-11-16 23:40:33,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 425 transitions, 1388 flow [2024-11-16 23:40:33,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 425 transitions, 1384 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:40:33,283 INFO L231 Difference]: Finished difference. Result has 257 places, 376 transitions, 1381 flow [2024-11-16 23:40:33,284 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1381, PETRI_PLACES=257, PETRI_TRANSITIONS=376} [2024-11-16 23:40:33,285 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, 5 predicate places. [2024-11-16 23:40:33,285 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 376 transitions, 1381 flow [2024-11-16 23:40:33,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:40:33,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:33,286 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] [2024-11-16 23:40:33,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:40:33,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-16 23:40:33,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:33,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1441138820, now seen corresponding path program 1 times [2024-11-16 23:40:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:33,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022089714] [2024-11-16 23:40:33,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:33,348 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-16 23:40:33,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:33,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022089714] [2024-11-16 23:40:33,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022089714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:33,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:33,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:40:33,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984054489] [2024-11-16 23:40:33,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:33,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:33,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:33,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:33,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:33,376 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 267 [2024-11-16 23:40:33,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 376 transitions, 1381 flow. Second operand has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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-16 23:40:33,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:33,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 267 [2024-11-16 23:40:33,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:37,065 INFO L124 PetriNetUnfolderBase]: 9909/32935 cut-off events. [2024-11-16 23:40:37,065 INFO L125 PetriNetUnfolderBase]: For 4659/5158 co-relation queries the response was YES. [2024-11-16 23:40:37,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58047 conditions, 32935 events. 9909/32935 cut-off events. For 4659/5158 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 384652 event pairs, 5139 based on Foata normal form. 1/30387 useless extension candidates. Maximal degree in co-relation 58004. Up to 12346 conditions per place. [2024-11-16 23:40:37,304 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 32 selfloop transitions, 3 changer transitions 0/384 dead transitions. [2024-11-16 23:40:37,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 384 transitions, 1473 flow [2024-11-16 23:40:37,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2024-11-16 23:40:37,307 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8739076154806492 [2024-11-16 23:40:37,307 INFO L175 Difference]: Start difference. First operand has 257 places, 376 transitions, 1381 flow. Second operand 3 states and 700 transitions. [2024-11-16 23:40:37,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 384 transitions, 1473 flow [2024-11-16 23:40:37,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 384 transitions, 1473 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:40:37,391 INFO L231 Difference]: Finished difference. Result has 260 places, 378 transitions, 1406 flow [2024-11-16 23:40:37,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1406, PETRI_PLACES=260, PETRI_TRANSITIONS=378} [2024-11-16 23:40:37,393 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, 8 predicate places. [2024-11-16 23:40:37,393 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 378 transitions, 1406 flow [2024-11-16 23:40:37,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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-16 23:40:37,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:37,394 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] [2024-11-16 23:40:37,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:40:37,395 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-16 23:40:37,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1128186056, now seen corresponding path program 1 times [2024-11-16 23:40:37,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215180746] [2024-11-16 23:40:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:37,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:37,435 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-16 23:40:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:37,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215180746] [2024-11-16 23:40:37,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215180746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:37,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:37,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:40:37,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819551986] [2024-11-16 23:40:37,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:37,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:37,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:37,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:37,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 267 [2024-11-16 23:40:37,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 378 transitions, 1406 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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-16 23:40:37,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:37,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 267 [2024-11-16 23:40:37,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:41,629 INFO L124 PetriNetUnfolderBase]: 10188/34479 cut-off events. [2024-11-16 23:40:41,629 INFO L125 PetriNetUnfolderBase]: For 4921/5401 co-relation queries the response was YES. [2024-11-16 23:40:41,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62138 conditions, 34479 events. 10188/34479 cut-off events. For 4921/5401 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 405990 event pairs, 4069 based on Foata normal form. 0/32501 useless extension candidates. Maximal degree in co-relation 62094. Up to 12347 conditions per place. [2024-11-16 23:40:41,862 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 38 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2024-11-16 23:40:41,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 385 transitions, 1505 flow [2024-11-16 23:40:41,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2024-11-16 23:40:41,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8601747815230961 [2024-11-16 23:40:41,865 INFO L175 Difference]: Start difference. First operand has 260 places, 378 transitions, 1406 flow. Second operand 3 states and 689 transitions. [2024-11-16 23:40:41,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 385 transitions, 1505 flow [2024-11-16 23:40:41,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 385 transitions, 1502 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:40:41,990 INFO L231 Difference]: Finished difference. Result has 258 places, 376 transitions, 1409 flow [2024-11-16 23:40:41,990 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1395, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1409, PETRI_PLACES=258, PETRI_TRANSITIONS=376} [2024-11-16 23:40:41,991 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, 6 predicate places. [2024-11-16 23:40:41,991 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 376 transitions, 1409 flow [2024-11-16 23:40:41,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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-16 23:40:41,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:41,992 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] [2024-11-16 23:40:41,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:40:41,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-16 23:40:41,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1644922719, now seen corresponding path program 1 times [2024-11-16 23:40:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:41,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267999421] [2024-11-16 23:40:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:41,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:42,298 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-16 23:40:42,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:42,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267999421] [2024-11-16 23:40:42,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267999421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:42,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:42,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:40:42,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600640311] [2024-11-16 23:40:42,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:42,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:40:42,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:42,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:40:42,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:40:42,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 267 [2024-11-16 23:40:42,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 376 transitions, 1409 flow. Second operand has 6 states, 6 states have (on average 180.33333333333334) internal successors, (1082), 6 states have internal predecessors, (1082), 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-16 23:40:42,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:42,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 267 [2024-11-16 23:40:42,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:53,204 INFO L124 PetriNetUnfolderBase]: 39054/90104 cut-off events. [2024-11-16 23:40:53,205 INFO L125 PetriNetUnfolderBase]: For 32750/36556 co-relation queries the response was YES. [2024-11-16 23:40:53,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204587 conditions, 90104 events. 39054/90104 cut-off events. For 32750/36556 co-relation queries the response was YES. Maximal size of possible extension queue 1975. Compared 1047036 event pairs, 9985 based on Foata normal form. 47/86242 useless extension candidates. Maximal degree in co-relation 204542. Up to 36092 conditions per place. [2024-11-16 23:40:54,179 INFO L140 encePairwiseOnDemand]: 219/267 looper letters, 473 selfloop transitions, 219 changer transitions 0/867 dead transitions. [2024-11-16 23:40:54,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 867 transitions, 5023 flow [2024-11-16 23:40:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:40:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:40:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1406 transitions. [2024-11-16 23:40:54,183 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776529338327091 [2024-11-16 23:40:54,183 INFO L175 Difference]: Start difference. First operand has 258 places, 376 transitions, 1409 flow. Second operand 6 states and 1406 transitions. [2024-11-16 23:40:54,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 867 transitions, 5023 flow [2024-11-16 23:40:54,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 867 transitions, 5023 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:40:54,554 INFO L231 Difference]: Finished difference. Result has 268 places, 607 transitions, 3725 flow [2024-11-16 23:40:54,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3725, PETRI_PLACES=268, PETRI_TRANSITIONS=607} [2024-11-16 23:40:54,555 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, 16 predicate places. [2024-11-16 23:40:54,555 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 607 transitions, 3725 flow [2024-11-16 23:40:54,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.33333333333334) internal successors, (1082), 6 states have internal predecessors, (1082), 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-16 23:40:54,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:54,556 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] [2024-11-16 23:40:54,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:40:54,557 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-16 23:40:54,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:54,557 INFO L85 PathProgramCache]: Analyzing trace with hash 851260392, now seen corresponding path program 1 times [2024-11-16 23:40:54,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:54,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337160748] [2024-11-16 23:40:54,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:54,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:54,641 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-16 23:40:54,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:54,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337160748] [2024-11-16 23:40:54,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337160748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:40:54,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680301385] [2024-11-16 23:40:54,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:54,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:40:54,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:40:54,645 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-16 23:40:54,650 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-16 23:40:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:54,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 23:40:54,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:40:54,855 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-16 23:40:54,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:40:54,925 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-16 23:40:54,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680301385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:40:54,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:40:54,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-16 23:40:54,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706231629] [2024-11-16 23:40:54,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:40:54,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 23:40:54,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:54,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 23:40:54,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 23:40:54,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 267 [2024-11-16 23:40:54,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 607 transitions, 3725 flow. Second operand has 10 states, 10 states have (on average 221.3) internal successors, (2213), 10 states have internal predecessors, (2213), 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-16 23:40:54,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:54,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 267 [2024-11-16 23:40:54,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:41:01,952 INFO L124 PetriNetUnfolderBase]: 21583/56141 cut-off events. [2024-11-16 23:41:01,952 INFO L125 PetriNetUnfolderBase]: For 52108/56168 co-relation queries the response was YES. [2024-11-16 23:41:02,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151902 conditions, 56141 events. 21583/56141 cut-off events. For 52108/56168 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 623927 event pairs, 2542 based on Foata normal form. 596/55343 useless extension candidates. Maximal degree in co-relation 151852. Up to 19836 conditions per place. [2024-11-16 23:41:02,658 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 72 selfloop transitions, 9 changer transitions 0/611 dead transitions. [2024-11-16 23:41:02,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 611 transitions, 3887 flow [2024-11-16 23:41:02,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 23:41:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 23:41:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2052 transitions. [2024-11-16 23:41:02,663 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2024-11-16 23:41:02,663 INFO L175 Difference]: Start difference. First operand has 268 places, 607 transitions, 3725 flow. Second operand 9 states and 2052 transitions. [2024-11-16 23:41:02,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 611 transitions, 3887 flow [2024-11-16 23:41:03,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 611 transitions, 3869 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-16 23:41:03,545 INFO L231 Difference]: Finished difference. Result has 224 places, 555 transitions, 3613 flow [2024-11-16 23:41:03,546 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=3591, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3613, PETRI_PLACES=224, PETRI_TRANSITIONS=555} [2024-11-16 23:41:03,546 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, -28 predicate places. [2024-11-16 23:41:03,547 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 555 transitions, 3613 flow [2024-11-16 23:41:03,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 221.3) internal successors, (2213), 10 states have internal predecessors, (2213), 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-16 23:41:03,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:41:03,548 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] [2024-11-16 23:41:03,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 23:41:03,749 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,SelfDestructingSolverStorable14 [2024-11-16 23:41:03,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-16 23:41:03,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:41:03,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1238244232, now seen corresponding path program 1 times [2024-11-16 23:41:03,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:41:03,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433261660] [2024-11-16 23:41:03,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:41:03,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:41:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:41:04,129 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-16 23:41:04,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:41:04,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433261660] [2024-11-16 23:41:04,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433261660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:41:04,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:41:04,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:41:04,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051124927] [2024-11-16 23:41:04,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:41:04,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:41:04,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:41:04,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:41:04,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:41:04,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 267 [2024-11-16 23:41:04,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 555 transitions, 3613 flow. Second operand has 6 states, 6 states have (on average 174.33333333333334) internal successors, (1046), 6 states have internal predecessors, (1046), 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-16 23:41:04,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:41:04,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 267 [2024-11-16 23:41:04,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand