./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_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 3e2d1ca14c91be6e836759580a015ed2d4b9eb8ea9888f9f925ea579405b630f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:33:22,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:33:23,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:33:23,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:33:23,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:33:23,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:33:23,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:33:23,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:33:23,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:33:23,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:33:23,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:33:23,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:33:23,088 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:33:23,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:33:23,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:33:23,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:33:23,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:33:23,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:33:23,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:33:23,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:33:23,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:33:23,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:33:23,095 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:33:23,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:33:23,095 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:33:23,095 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:33:23,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:33:23,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:33:23,096 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:33:23,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:33:23,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:33:23,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:33:23,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:33:23,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:33:23,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:33:23,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:33:23,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:33:23,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:33:23,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:33:23,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:33:23,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:33:23,101 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 -> 3e2d1ca14c91be6e836759580a015ed2d4b9eb8ea9888f9f925ea579405b630f [2024-11-10 14:33:23,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:33:23,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:33:23,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:33:23,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:33:23,439 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:33:23,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i [2024-11-10 14:33:24,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:33:25,087 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:33:25,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i [2024-11-10 14:33:25,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7029dbd/6e41ad0c4f9b4c2394ad4a2821f8b756/FLAG57ec3f9f7 [2024-11-10 14:33:25,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7029dbd/6e41ad0c4f9b4c2394ad4a2821f8b756 [2024-11-10 14:33:25,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:33:25,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:33:25,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:33:25,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:33:25,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:33:25,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47af10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25, skipping insertion in model container [2024-11-10 14:33:25,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:33:25,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:33:25,697 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:33:25,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:33:25,819 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:33:25,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25 WrapperNode [2024-11-10 14:33:25,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:33:25,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:33:25,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:33:25,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:33:25,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,876 INFO L138 Inliner]: procedures = 252, calls = 52, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 168 [2024-11-10 14:33:25,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:33:25,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:33:25,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:33:25,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:33:25,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:33:25,920 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:33:25,923 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:33:25,923 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:33:25,924 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:33:25,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:25,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:33:25,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:33:26,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:33:26,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:33:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:33:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:33:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:33:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:33:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:33:26,016 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 14:33:26,016 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 14:33:26,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:33:26,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:33:26,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:33:26,018 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:33:26,179 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:33:26,181 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:33:26,407 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L911: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-10 14:33:26,407 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L911-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-10 14:33:26,484 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:33:26,485 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:33:26,536 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:33:26,536 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:33:26,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:33:26 BoogieIcfgContainer [2024-11-10 14:33:26,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:33:26,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:33:26,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:33:26,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:33:26,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:33:25" (1/3) ... [2024-11-10 14:33:26,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c88d88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:26, skipping insertion in model container [2024-11-10 14:33:26,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (2/3) ... [2024-11-10 14:33:26,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c88d88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:26, skipping insertion in model container [2024-11-10 14:33:26,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:33:26" (3/3) ... [2024-11-10 14:33:26,548 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_28-funptr_racefree.i [2024-11-10 14:33:26,565 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:33:26,565 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-10 14:33:26,567 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:33:26,657 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:33:26,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 176 transitions, 359 flow [2024-11-10 14:33:26,805 INFO L124 PetriNetUnfolderBase]: 19/248 cut-off events. [2024-11-10 14:33:26,805 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:33:26,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 248 events. 19/248 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 754 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 137. Up to 4 conditions per place. [2024-11-10 14:33:26,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 176 transitions, 359 flow [2024-11-10 14:33:26,823 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 176 transitions, 359 flow [2024-11-10 14:33:26,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:33:26,842 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;@2f0dd9c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:33:26,843 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-10 14:33:26,856 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:33:26,857 INFO L124 PetriNetUnfolderBase]: 1/50 cut-off events. [2024-11-10 14:33:26,857 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:33:26,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:26,858 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] [2024-11-10 14:33:26,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:33:26,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash -819426513, now seen corresponding path program 1 times [2024-11-10 14:33:26,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:26,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799403433] [2024-11-10 14:33:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:27,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:27,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799403433] [2024-11-10 14:33:27,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799403433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:27,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:27,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:27,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145510881] [2024-11-10 14:33:27,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:27,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:33:27,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:27,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:33:27,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:33:27,159 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 176 [2024-11-10 14:33:27,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 176 transitions, 359 flow. Second operand has 2 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:27,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:27,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 176 [2024-11-10 14:33:27,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:27,346 INFO L124 PetriNetUnfolderBase]: 49/598 cut-off events. [2024-11-10 14:33:27,346 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:33:27,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 598 events. 49/598 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2851 event pairs, 48 based on Foata normal form. 97/642 useless extension candidates. Maximal degree in co-relation 605. Up to 119 conditions per place. [2024-11-10 14:33:27,353 INFO L140 encePairwiseOnDemand]: 164/176 looper letters, 16 selfloop transitions, 0 changer transitions 0/162 dead transitions. [2024-11-10 14:33:27,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 162 transitions, 363 flow [2024-11-10 14:33:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:33:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:33:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 322 transitions. [2024-11-10 14:33:27,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9147727272727273 [2024-11-10 14:33:27,368 INFO L175 Difference]: Start difference. First operand has 166 places, 176 transitions, 359 flow. Second operand 2 states and 322 transitions. [2024-11-10 14:33:27,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 162 transitions, 363 flow [2024-11-10 14:33:27,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 162 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:27,377 INFO L231 Difference]: Finished difference. Result has 165 places, 162 transitions, 331 flow [2024-11-10 14:33:27,379 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=331, PETRI_PLACES=165, PETRI_TRANSITIONS=162} [2024-11-10 14:33:27,383 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, -1 predicate places. [2024-11-10 14:33:27,383 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 162 transitions, 331 flow [2024-11-10 14:33:27,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:27,384 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:27,385 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] [2024-11-10 14:33:27,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:33:27,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:33:27,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash 39671614, now seen corresponding path program 1 times [2024-11-10 14:33:27,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:27,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962622053] [2024-11-10 14:33:27,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:27,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962622053] [2024-11-10 14:33:27,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962622053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:27,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:33:27,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223739689] [2024-11-10 14:33:27,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:27,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:27,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:27,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:27,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:27,637 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 176 [2024-11-10 14:33:27,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 162 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:27,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:27,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 176 [2024-11-10 14:33:27,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:27,798 INFO L124 PetriNetUnfolderBase]: 80/750 cut-off events. [2024-11-10 14:33:27,798 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:33:27,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 750 events. 80/750 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4045 event pairs, 63 based on Foata normal form. 1/682 useless extension candidates. Maximal degree in co-relation 936. Up to 174 conditions per place. [2024-11-10 14:33:27,805 INFO L140 encePairwiseOnDemand]: 173/176 looper letters, 28 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-11-10 14:33:27,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 170 transitions, 407 flow [2024-11-10 14:33:27,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2024-11-10 14:33:27,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8598484848484849 [2024-11-10 14:33:27,812 INFO L175 Difference]: Start difference. First operand has 165 places, 162 transitions, 331 flow. Second operand 3 states and 454 transitions. [2024-11-10 14:33:27,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 170 transitions, 407 flow [2024-11-10 14:33:27,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 170 transitions, 407 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:27,817 INFO L231 Difference]: Finished difference. Result has 168 places, 162 transitions, 339 flow [2024-11-10 14:33:27,817 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=168, PETRI_TRANSITIONS=162} [2024-11-10 14:33:27,818 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, 2 predicate places. [2024-11-10 14:33:27,818 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 162 transitions, 339 flow [2024-11-10 14:33:27,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:27,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:27,819 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] [2024-11-10 14:33:27,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:33:27,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:33:27,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1457814848, now seen corresponding path program 1 times [2024-11-10 14:33:27,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908611443] [2024-11-10 14:33:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:28,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:28,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908611443] [2024-11-10 14:33:28,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908611443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:28,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:28,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18231465] [2024-11-10 14:33:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:28,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:28,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:28,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:28,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:28,501 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 176 [2024-11-10 14:33:28,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 162 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:28,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:28,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 176 [2024-11-10 14:33:28,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:28,721 INFO L124 PetriNetUnfolderBase]: 160/1140 cut-off events. [2024-11-10 14:33:28,722 INFO L125 PetriNetUnfolderBase]: For 16/19 co-relation queries the response was YES. [2024-11-10 14:33:28,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 1140 events. 160/1140 cut-off events. For 16/19 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7211 event pairs, 93 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 1530. Up to 267 conditions per place. [2024-11-10 14:33:28,728 INFO L140 encePairwiseOnDemand]: 170/176 looper letters, 60 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2024-11-10 14:33:28,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 193 transitions, 531 flow [2024-11-10 14:33:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 840 transitions. [2024-11-10 14:33:28,731 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7954545454545454 [2024-11-10 14:33:28,731 INFO L175 Difference]: Start difference. First operand has 168 places, 162 transitions, 339 flow. Second operand 6 states and 840 transitions. [2024-11-10 14:33:28,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 193 transitions, 531 flow [2024-11-10 14:33:28,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 193 transitions, 527 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:28,737 INFO L231 Difference]: Finished difference. Result has 170 places, 161 transitions, 343 flow [2024-11-10 14:33:28,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=170, PETRI_TRANSITIONS=161} [2024-11-10 14:33:28,739 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, 4 predicate places. [2024-11-10 14:33:28,740 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 161 transitions, 343 flow [2024-11-10 14:33:28,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:28,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:28,741 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] [2024-11-10 14:33:28,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:33:28,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:33:28,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1555458366, now seen corresponding path program 1 times [2024-11-10 14:33:28,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:28,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778881295] [2024-11-10 14:33:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:28,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:28,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778881295] [2024-11-10 14:33:28,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778881295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:28,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:28,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:28,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153658528] [2024-11-10 14:33:28,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:28,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:28,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:28,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:28,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:28,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 176 [2024-11-10 14:33:28,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 161 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:28,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:28,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 176 [2024-11-10 14:33:28,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:28,960 INFO L124 PetriNetUnfolderBase]: 114/1138 cut-off events. [2024-11-10 14:33:28,960 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:33:28,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 1138 events. 114/1138 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7406 event pairs, 36 based on Foata normal form. 0/1028 useless extension candidates. Maximal degree in co-relation 1417. Up to 133 conditions per place. [2024-11-10 14:33:28,966 INFO L140 encePairwiseOnDemand]: 172/176 looper letters, 33 selfloop transitions, 3 changer transitions 0/177 dead transitions. [2024-11-10 14:33:28,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 177 transitions, 450 flow [2024-11-10 14:33:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2024-11-10 14:33:28,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8825757575757576 [2024-11-10 14:33:28,968 INFO L175 Difference]: Start difference. First operand has 170 places, 161 transitions, 343 flow. Second operand 3 states and 466 transitions. [2024-11-10 14:33:28,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 177 transitions, 450 flow [2024-11-10 14:33:28,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 177 transitions, 440 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:33:28,972 INFO L231 Difference]: Finished difference. Result has 169 places, 163 transitions, 355 flow [2024-11-10 14:33:28,973 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=355, PETRI_PLACES=169, PETRI_TRANSITIONS=163} [2024-11-10 14:33:28,974 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, 3 predicate places. [2024-11-10 14:33:28,974 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 163 transitions, 355 flow [2024-11-10 14:33:28,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:28,975 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:28,975 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] [2024-11-10 14:33:28,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:33:28,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:33:28,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:28,976 INFO L85 PathProgramCache]: Analyzing trace with hash 82452200, now seen corresponding path program 1 times [2024-11-10 14:33:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089094371] [2024-11-10 14:33:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:29,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:29,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089094371] [2024-11-10 14:33:29,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089094371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:33:29,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641138253] [2024-11-10 14:33:29,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:29,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:29,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:29,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:33:29,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:33:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:29,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:33:29,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:33:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:33:29,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:33:29,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641138253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:29,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:33:29,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-10 14:33:29,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367436080] [2024-11-10 14:33:29,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:29,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:29,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:29,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:29,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:29,210 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 176 [2024-11-10 14:33:29,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 163 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:29,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:29,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 176 [2024-11-10 14:33:29,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:29,429 INFO L124 PetriNetUnfolderBase]: 183/1503 cut-off events. [2024-11-10 14:33:29,430 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-11-10 14:33:29,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 1503 events. 183/1503 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 10834 event pairs, 136 based on Foata normal form. 0/1341 useless extension candidates. Maximal degree in co-relation 1974. Up to 345 conditions per place. [2024-11-10 14:33:29,436 INFO L140 encePairwiseOnDemand]: 171/176 looper letters, 31 selfloop transitions, 5 changer transitions 0/174 dead transitions. [2024-11-10 14:33:29,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 174 transitions, 453 flow [2024-11-10 14:33:29,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2024-11-10 14:33:29,437 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8579545454545454 [2024-11-10 14:33:29,438 INFO L175 Difference]: Start difference. First operand has 169 places, 163 transitions, 355 flow. Second operand 3 states and 453 transitions. [2024-11-10 14:33:29,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 174 transitions, 453 flow [2024-11-10 14:33:29,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 174 transitions, 445 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:29,441 INFO L231 Difference]: Finished difference. Result has 171 places, 166 transitions, 385 flow [2024-11-10 14:33:29,442 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=171, PETRI_TRANSITIONS=166} [2024-11-10 14:33:29,442 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, 5 predicate places. [2024-11-10 14:33:29,443 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 166 transitions, 385 flow [2024-11-10 14:33:29,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:29,443 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:29,443 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] [2024-11-10 14:33:29,463 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-10 14:33:29,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:29,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:33:29,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:29,646 INFO L85 PathProgramCache]: Analyzing trace with hash 923531023, now seen corresponding path program 1 times [2024-11-10 14:33:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:29,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856620649] [2024-11-10 14:33:29,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:29,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:29,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:33:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:29,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:33:29,720 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:33:29,721 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2024-11-10 14:33:29,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-10 14:33:29,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-10 14:33:29,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-10 14:33:29,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-10 14:33:29,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-10 14:33:29,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-11-10 14:33:29,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-10 14:33:29,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-10 14:33:29,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-10 14:33:29,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-10 14:33:29,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-10 14:33:29,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-10 14:33:29,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-10 14:33:29,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-10 14:33:29,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:33:29,727 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 14:33:29,732 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:33:29,732 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:33:29,771 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:33:29,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 240 transitions, 496 flow [2024-11-10 14:33:29,827 INFO L124 PetriNetUnfolderBase]: 34/413 cut-off events. [2024-11-10 14:33:29,828 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:33:29,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 413 events. 34/413 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1510 event pairs, 0 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 250. Up to 8 conditions per place. [2024-11-10 14:33:29,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 240 transitions, 496 flow [2024-11-10 14:33:29,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 240 transitions, 496 flow [2024-11-10 14:33:29,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:33:29,840 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;@2f0dd9c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:33:29,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-10 14:33:29,845 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:33:29,847 INFO L124 PetriNetUnfolderBase]: 1/50 cut-off events. [2024-11-10 14:33:29,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:33:29,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:29,847 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] [2024-11-10 14:33:29,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:29,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:29,849 INFO L85 PathProgramCache]: Analyzing trace with hash 173159455, now seen corresponding path program 1 times [2024-11-10 14:33:29,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:29,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118669710] [2024-11-10 14:33:29,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:29,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:29,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:29,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118669710] [2024-11-10 14:33:29,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118669710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:29,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:29,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:29,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500700449] [2024-11-10 14:33:29,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:29,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:33:29,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:29,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:33:29,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:33:29,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 240 [2024-11-10 14:33:29,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 240 transitions, 496 flow. Second operand has 2 states, 2 states have (on average 196.0) internal successors, (392), 2 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:29,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:29,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 240 [2024-11-10 14:33:29,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:30,673 INFO L124 PetriNetUnfolderBase]: 1004/5649 cut-off events. [2024-11-10 14:33:30,674 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-10 14:33:30,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7360 conditions, 5649 events. 1004/5649 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 54204 event pairs, 1000 based on Foata normal form. 1359/6511 useless extension candidates. Maximal degree in co-relation 6479. Up to 1658 conditions per place. [2024-11-10 14:33:30,717 INFO L140 encePairwiseOnDemand]: 222/240 looper letters, 26 selfloop transitions, 0 changer transitions 0/220 dead transitions. [2024-11-10 14:33:30,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 220 transitions, 508 flow [2024-11-10 14:33:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:33:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:33:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 434 transitions. [2024-11-10 14:33:30,719 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9041666666666667 [2024-11-10 14:33:30,719 INFO L175 Difference]: Start difference. First operand has 225 places, 240 transitions, 496 flow. Second operand 2 states and 434 transitions. [2024-11-10 14:33:30,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 220 transitions, 508 flow [2024-11-10 14:33:30,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 220 transitions, 508 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:30,724 INFO L231 Difference]: Finished difference. Result has 224 places, 220 transitions, 456 flow [2024-11-10 14:33:30,725 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=456, PETRI_PLACES=224, PETRI_TRANSITIONS=220} [2024-11-10 14:33:30,725 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -1 predicate places. [2024-11-10 14:33:30,726 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 220 transitions, 456 flow [2024-11-10 14:33:30,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 196.0) internal successors, (392), 2 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:30,726 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:30,726 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] [2024-11-10 14:33:30,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:33:30,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:30,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:30,727 INFO L85 PathProgramCache]: Analyzing trace with hash 745065790, now seen corresponding path program 1 times [2024-11-10 14:33:30,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:30,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881811196] [2024-11-10 14:33:30,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:30,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:30,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:30,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881811196] [2024-11-10 14:33:30,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881811196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:30,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:30,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:33:30,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709659980] [2024-11-10 14:33:30,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:30,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:30,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:30,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:30,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:30,790 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 240 [2024-11-10 14:33:30,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 220 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:30,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:30,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 240 [2024-11-10 14:33:30,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:31,926 INFO L124 PetriNetUnfolderBase]: 1626/8499 cut-off events. [2024-11-10 14:33:31,926 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-11-10 14:33:31,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11191 conditions, 8499 events. 1626/8499 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 90093 event pairs, 1608 based on Foata normal form. 1/7709 useless extension candidates. Maximal degree in co-relation 11186. Up to 2629 conditions per place. [2024-11-10 14:33:31,986 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 39 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2024-11-10 14:33:31,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 229 transitions, 556 flow [2024-11-10 14:33:31,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2024-11-10 14:33:31,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8458333333333333 [2024-11-10 14:33:31,990 INFO L175 Difference]: Start difference. First operand has 224 places, 220 transitions, 456 flow. Second operand 3 states and 609 transitions. [2024-11-10 14:33:31,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 229 transitions, 556 flow [2024-11-10 14:33:31,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 229 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:31,999 INFO L231 Difference]: Finished difference. Result has 227 places, 221 transitions, 468 flow [2024-11-10 14:33:32,000 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=227, PETRI_TRANSITIONS=221} [2024-11-10 14:33:32,001 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 2 predicate places. [2024-11-10 14:33:32,003 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 221 transitions, 468 flow [2024-11-10 14:33:32,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:32,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:32,004 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] [2024-11-10 14:33:32,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:33:32,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:32,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2116130496, now seen corresponding path program 1 times [2024-11-10 14:33:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:32,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580938800] [2024-11-10 14:33:32,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:32,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:32,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:32,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580938800] [2024-11-10 14:33:32,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580938800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:32,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:32,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:32,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624825611] [2024-11-10 14:33:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:32,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:32,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:32,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:32,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:32,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 240 [2024-11-10 14:33:32,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 221 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 178.5) internal successors, (1071), 6 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:32,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:32,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 240 [2024-11-10 14:33:32,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:34,189 INFO L124 PetriNetUnfolderBase]: 3186/12847 cut-off events. [2024-11-10 14:33:34,189 INFO L125 PetriNetUnfolderBase]: For 205/232 co-relation queries the response was YES. [2024-11-10 14:33:34,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18167 conditions, 12847 events. 3186/12847 cut-off events. For 205/232 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 141510 event pairs, 1571 based on Foata normal form. 0/11690 useless extension candidates. Maximal degree in co-relation 18160. Up to 3779 conditions per place. [2024-11-10 14:33:34,383 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 102 selfloop transitions, 6 changer transitions 0/284 dead transitions. [2024-11-10 14:33:34,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 284 transitions, 810 flow [2024-11-10 14:33:34,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1170 transitions. [2024-11-10 14:33:34,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8125 [2024-11-10 14:33:34,387 INFO L175 Difference]: Start difference. First operand has 227 places, 221 transitions, 468 flow. Second operand 6 states and 1170 transitions. [2024-11-10 14:33:34,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 284 transitions, 810 flow [2024-11-10 14:33:34,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 284 transitions, 808 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:33:34,393 INFO L231 Difference]: Finished difference. Result has 230 places, 220 transitions, 476 flow [2024-11-10 14:33:34,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=230, PETRI_TRANSITIONS=220} [2024-11-10 14:33:34,394 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 5 predicate places. [2024-11-10 14:33:34,394 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 220 transitions, 476 flow [2024-11-10 14:33:34,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 178.5) internal successors, (1071), 6 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:34,395 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:34,395 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] [2024-11-10 14:33:34,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:33:34,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:34,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:34,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1690462740, now seen corresponding path program 1 times [2024-11-10 14:33:34,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:34,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821175605] [2024-11-10 14:33:34,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:34,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:34,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:34,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821175605] [2024-11-10 14:33:34,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821175605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:34,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:34,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:34,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779654623] [2024-11-10 14:33:34,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:34,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:34,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:34,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:34,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:34,441 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 240 [2024-11-10 14:33:34,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 220 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:34,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:34,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 240 [2024-11-10 14:33:34,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:36,020 INFO L124 PetriNetUnfolderBase]: 3293/16177 cut-off events. [2024-11-10 14:33:36,020 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-11-10 14:33:36,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21688 conditions, 16177 events. 3293/16177 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 193285 event pairs, 880 based on Foata normal form. 0/14552 useless extension candidates. Maximal degree in co-relation 21681. Up to 3072 conditions per place. [2024-11-10 14:33:36,247 INFO L140 encePairwiseOnDemand]: 233/240 looper letters, 58 selfloop transitions, 5 changer transitions 0/250 dead transitions. [2024-11-10 14:33:36,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 250 transitions, 673 flow [2024-11-10 14:33:36,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2024-11-10 14:33:36,250 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8736111111111111 [2024-11-10 14:33:36,250 INFO L175 Difference]: Start difference. First operand has 230 places, 220 transitions, 476 flow. Second operand 3 states and 629 transitions. [2024-11-10 14:33:36,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 250 transitions, 673 flow [2024-11-10 14:33:36,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 250 transitions, 661 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:33:36,257 INFO L231 Difference]: Finished difference. Result has 229 places, 225 transitions, 508 flow [2024-11-10 14:33:36,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=229, PETRI_TRANSITIONS=225} [2024-11-10 14:33:36,258 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 4 predicate places. [2024-11-10 14:33:36,259 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 225 transitions, 508 flow [2024-11-10 14:33:36,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:36,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:36,260 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] [2024-11-10 14:33:36,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:33:36,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:36,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:36,260 INFO L85 PathProgramCache]: Analyzing trace with hash 806251286, now seen corresponding path program 1 times [2024-11-10 14:33:36,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:36,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771909297] [2024-11-10 14:33:36,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:36,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:36,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:36,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771909297] [2024-11-10 14:33:36,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771909297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:33:36,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831675219] [2024-11-10 14:33:36,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:36,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:36,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:36,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:33:36,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 14:33:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:36,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:33:36,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:33:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:33:36,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:33:36,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831675219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:36,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:33:36,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-10 14:33:36,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945787880] [2024-11-10 14:33:36,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:36,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:36,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:36,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:36,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:36,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 240 [2024-11-10 14:33:36,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 225 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:36,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:36,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 240 [2024-11-10 14:33:36,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:38,669 INFO L124 PetriNetUnfolderBase]: 4920/21508 cut-off events. [2024-11-10 14:33:38,669 INFO L125 PetriNetUnfolderBase]: For 1503/1524 co-relation queries the response was YES. [2024-11-10 14:33:38,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30905 conditions, 21508 events. 4920/21508 cut-off events. For 1503/1524 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 265520 event pairs, 3516 based on Foata normal form. 16/19345 useless extension candidates. Maximal degree in co-relation 30897. Up to 6750 conditions per place. [2024-11-10 14:33:38,773 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 52 selfloop transitions, 8 changer transitions 0/247 dead transitions. [2024-11-10 14:33:38,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 247 transitions, 684 flow [2024-11-10 14:33:38,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2024-11-10 14:33:38,776 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8527777777777777 [2024-11-10 14:33:38,776 INFO L175 Difference]: Start difference. First operand has 229 places, 225 transitions, 508 flow. Second operand 3 states and 614 transitions. [2024-11-10 14:33:38,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 247 transitions, 684 flow [2024-11-10 14:33:38,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 247 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:38,783 INFO L231 Difference]: Finished difference. Result has 231 places, 231 transitions, 564 flow [2024-11-10 14:33:38,784 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=231, PETRI_TRANSITIONS=231} [2024-11-10 14:33:38,785 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 6 predicate places. [2024-11-10 14:33:38,785 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 231 transitions, 564 flow [2024-11-10 14:33:38,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:38,785 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:38,786 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] [2024-11-10 14:33:38,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 14:33:38,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 14:33:38,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:38,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:38,988 INFO L85 PathProgramCache]: Analyzing trace with hash -936957190, now seen corresponding path program 1 times [2024-11-10 14:33:38,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:38,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068253757] [2024-11-10 14:33:38,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:38,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:39,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068253757] [2024-11-10 14:33:39,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068253757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:33:39,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659885015] [2024-11-10 14:33:39,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:39,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:39,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:39,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:33:39,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 14:33:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:39,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:33:39,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:33:39,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 14:33:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:33:39,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:33:39,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659885015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:39,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:33:39,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-10 14:33:39,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390995091] [2024-11-10 14:33:39,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:39,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:39,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:39,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:39,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:39,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 240 [2024-11-10 14:33:39,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 231 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:39,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:39,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 240 [2024-11-10 14:33:39,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:40,567 INFO L124 PetriNetUnfolderBase]: 2240/13877 cut-off events. [2024-11-10 14:33:40,567 INFO L125 PetriNetUnfolderBase]: For 579/610 co-relation queries the response was YES. [2024-11-10 14:33:40,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18614 conditions, 13877 events. 2240/13877 cut-off events. For 579/610 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 169990 event pairs, 1273 based on Foata normal form. 50/12868 useless extension candidates. Maximal degree in co-relation 18605. Up to 3243 conditions per place. [2024-11-10 14:33:40,630 INFO L140 encePairwiseOnDemand]: 226/240 looper letters, 35 selfloop transitions, 14 changer transitions 0/251 dead transitions. [2024-11-10 14:33:40,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 251 transitions, 701 flow [2024-11-10 14:33:40,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 634 transitions. [2024-11-10 14:33:40,633 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8805555555555555 [2024-11-10 14:33:40,633 INFO L175 Difference]: Start difference. First operand has 231 places, 231 transitions, 564 flow. Second operand 3 states and 634 transitions. [2024-11-10 14:33:40,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 251 transitions, 701 flow [2024-11-10 14:33:40,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 251 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:40,639 INFO L231 Difference]: Finished difference. Result has 232 places, 240 transitions, 622 flow [2024-11-10 14:33:40,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=232, PETRI_TRANSITIONS=240} [2024-11-10 14:33:40,640 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 7 predicate places. [2024-11-10 14:33:40,640 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 240 transitions, 622 flow [2024-11-10 14:33:40,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:40,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:40,641 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] [2024-11-10 14:33:40,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 14:33:40,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:40,842 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:40,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:40,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1074227469, now seen corresponding path program 1 times [2024-11-10 14:33:40,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:40,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181270370] [2024-11-10 14:33:40,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:40,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:40,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:40,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181270370] [2024-11-10 14:33:40,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181270370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:40,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:40,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:40,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739032501] [2024-11-10 14:33:40,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:40,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:40,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:40,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:40,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:40,925 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 240 [2024-11-10 14:33:40,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 240 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:40,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:40,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 240 [2024-11-10 14:33:40,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:46,203 INFO L124 PetriNetUnfolderBase]: 12979/49989 cut-off events. [2024-11-10 14:33:46,203 INFO L125 PetriNetUnfolderBase]: For 9194/9580 co-relation queries the response was YES. [2024-11-10 14:33:46,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82809 conditions, 49989 events. 12979/49989 cut-off events. For 9194/9580 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 680716 event pairs, 4416 based on Foata normal form. 11/45622 useless extension candidates. Maximal degree in co-relation 82799. Up to 11072 conditions per place. [2024-11-10 14:33:46,494 INFO L140 encePairwiseOnDemand]: 221/240 looper letters, 92 selfloop transitions, 14 changer transitions 0/290 dead transitions. [2024-11-10 14:33:46,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 290 transitions, 1009 flow [2024-11-10 14:33:46,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2024-11-10 14:33:46,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8569444444444444 [2024-11-10 14:33:46,497 INFO L175 Difference]: Start difference. First operand has 232 places, 240 transitions, 622 flow. Second operand 3 states and 617 transitions. [2024-11-10 14:33:46,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 290 transitions, 1009 flow [2024-11-10 14:33:46,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 290 transitions, 981 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:33:46,517 INFO L231 Difference]: Finished difference. Result has 235 places, 254 transitions, 730 flow [2024-11-10 14:33:46,517 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=235, PETRI_TRANSITIONS=254} [2024-11-10 14:33:46,518 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 10 predicate places. [2024-11-10 14:33:46,518 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 254 transitions, 730 flow [2024-11-10 14:33:46,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:46,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:46,519 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] [2024-11-10 14:33:46,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:33:46,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:46,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:46,520 INFO L85 PathProgramCache]: Analyzing trace with hash 904036544, now seen corresponding path program 1 times [2024-11-10 14:33:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:46,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113383321] [2024-11-10 14:33:46,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:46,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:46,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:46,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113383321] [2024-11-10 14:33:46,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113383321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:46,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:46,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:46,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054997652] [2024-11-10 14:33:46,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:46,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:46,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:46,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:46,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:46,607 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 240 [2024-11-10 14:33:46,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 254 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:46,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:46,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 240 [2024-11-10 14:33:46,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:53,052 INFO L124 PetriNetUnfolderBase]: 14186/60177 cut-off events. [2024-11-10 14:33:53,052 INFO L125 PetriNetUnfolderBase]: For 21024/22277 co-relation queries the response was YES. [2024-11-10 14:33:53,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106953 conditions, 60177 events. 14186/60177 cut-off events. For 21024/22277 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 865838 event pairs, 8139 based on Foata normal form. 98/55692 useless extension candidates. Maximal degree in co-relation 106942. Up to 20101 conditions per place. [2024-11-10 14:33:53,434 INFO L140 encePairwiseOnDemand]: 231/240 looper letters, 82 selfloop transitions, 14 changer transitions 0/289 dead transitions. [2024-11-10 14:33:53,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 289 transitions, 1062 flow [2024-11-10 14:33:53,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 605 transitions. [2024-11-10 14:33:53,436 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8402777777777778 [2024-11-10 14:33:53,436 INFO L175 Difference]: Start difference. First operand has 235 places, 254 transitions, 730 flow. Second operand 3 states and 605 transitions. [2024-11-10 14:33:53,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 289 transitions, 1062 flow [2024-11-10 14:33:53,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 289 transitions, 1024 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:53,471 INFO L231 Difference]: Finished difference. Result has 237 places, 266 transitions, 828 flow [2024-11-10 14:33:53,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=237, PETRI_TRANSITIONS=266} [2024-11-10 14:33:53,472 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 12 predicate places. [2024-11-10 14:33:53,473 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 266 transitions, 828 flow [2024-11-10 14:33:53,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:53,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:53,474 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:53,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:33:53,474 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:53,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:53,475 INFO L85 PathProgramCache]: Analyzing trace with hash -675713786, now seen corresponding path program 1 times [2024-11-10 14:33:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:53,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158703101] [2024-11-10 14:33:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:53,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:33:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:53,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:33:53,530 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:33:53,530 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2024-11-10 14:33:53,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-11-10 14:33:53,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-11-10 14:33:53,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-11-10 14:33:53,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-11-10 14:33:53,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2024-11-10 14:33:53,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-11-10 14:33:53,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-11-10 14:33:53,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-11-10 14:33:53,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-11-10 14:33:53,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-11-10 14:33:53,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-11-10 14:33:53,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-11-10 14:33:53,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-11-10 14:33:53,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-11-10 14:33:53,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-11-10 14:33:53,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-11-10 14:33:53,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-11-10 14:33:53,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-11-10 14:33:53,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-11-10 14:33:53,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:33:53,533 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:53,534 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:33:53,534 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:33:53,568 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:33:53,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 284 places, 304 transitions, 635 flow [2024-11-10 14:33:53,637 INFO L124 PetriNetUnfolderBase]: 54/625 cut-off events. [2024-11-10 14:33:53,637 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 14:33:53,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 625 events. 54/625 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2556 event pairs, 1 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 421. Up to 16 conditions per place. [2024-11-10 14:33:53,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 284 places, 304 transitions, 635 flow [2024-11-10 14:33:53,649 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 284 places, 304 transitions, 635 flow [2024-11-10 14:33:53,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:33:53,651 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;@2f0dd9c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:33:53,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-10 14:33:53,654 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:33:53,654 INFO L124 PetriNetUnfolderBase]: 1/50 cut-off events. [2024-11-10 14:33:53,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:33:53,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:53,655 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] [2024-11-10 14:33:53,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2024-11-10 14:33:53,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash -573883057, now seen corresponding path program 1 times [2024-11-10 14:33:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:53,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001048030] [2024-11-10 14:33:53,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:53,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:53,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:53,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001048030] [2024-11-10 14:33:53,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001048030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:53,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:53,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:53,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774440990] [2024-11-10 14:33:53,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:53,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:33:53,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:53,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:33:53,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:33:53,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 304 [2024-11-10 14:33:53,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 304 transitions, 635 flow. Second operand has 2 states, 2 states have (on average 244.0) internal successors, (488), 2 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:53,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:53,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 304 [2024-11-10 14:33:53,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:34:00,351 INFO L124 PetriNetUnfolderBase]: 14451/56558 cut-off events. [2024-11-10 14:34:00,352 INFO L125 PetriNetUnfolderBase]: For 1474/1474 co-relation queries the response was YES. [2024-11-10 14:34:00,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77693 conditions, 56558 events. 14451/56558 cut-off events. For 1474/1474 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 769461 event pairs, 14409 based on Foata normal form. 16491/68481 useless extension candidates. Maximal degree in co-relation 68646. Up to 20459 conditions per place. [2024-11-10 14:34:00,753 INFO L140 encePairwiseOnDemand]: 280/304 looper letters, 36 selfloop transitions, 0 changer transitions 0/278 dead transitions. [2024-11-10 14:34:00,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 278 transitions, 655 flow [2024-11-10 14:34:00,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:34:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:34:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 546 transitions. [2024-11-10 14:34:00,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8980263157894737 [2024-11-10 14:34:00,756 INFO L175 Difference]: Start difference. First operand has 284 places, 304 transitions, 635 flow. Second operand 2 states and 546 transitions. [2024-11-10 14:34:00,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 278 transitions, 655 flow [2024-11-10 14:34:00,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 278 transitions, 655 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:34:00,770 INFO L231 Difference]: Finished difference. Result has 283 places, 278 transitions, 583 flow [2024-11-10 14:34:00,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=583, PETRI_PLACES=283, PETRI_TRANSITIONS=278} [2024-11-10 14:34:00,771 INFO L277 CegarLoopForPetriNet]: 284 programPoint places, -1 predicate places. [2024-11-10 14:34:00,771 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 278 transitions, 583 flow [2024-11-10 14:34:00,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 244.0) internal successors, (488), 2 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:34:00,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:34:00,772 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] [2024-11-10 14:34:00,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:34:00,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2024-11-10 14:34:00,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:34:00,773 INFO L85 PathProgramCache]: Analyzing trace with hash -938415298, now seen corresponding path program 1 times [2024-11-10 14:34:00,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:34:00,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710732692] [2024-11-10 14:34:00,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:34:00,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:34:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:34:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:34:00,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:34:00,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710732692] [2024-11-10 14:34:00,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710732692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:34:00,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:34:00,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:34:00,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228842284] [2024-11-10 14:34:00,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:34:00,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:34:00,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:34:00,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:34:00,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:34:00,826 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 304 [2024-11-10 14:34:00,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 278 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:34:00,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:34:00,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 304 [2024-11-10 14:34:00,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:34:11,862 INFO L124 PetriNetUnfolderBase]: 23207/87384 cut-off events. [2024-11-10 14:34:11,862 INFO L125 PetriNetUnfolderBase]: For 3577/3577 co-relation queries the response was YES. [2024-11-10 14:34:12,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120623 conditions, 87384 events. 23207/87384 cut-off events. For 3577/3577 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 1254277 event pairs, 23089 based on Foata normal form. 1/80303 useless extension candidates. Maximal degree in co-relation 120617. Up to 32571 conditions per place.