./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.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_11-ptr_racing.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 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:32:36,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:32:36,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:32:36,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:32:36,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:32:36,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:32:36,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:32:36,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:32:36,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:32:36,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:32:36,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:32:36,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:32:36,699 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:32:36,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:32:36,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:32:36,703 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:32:36,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:32:36,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:32:36,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:32:36,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:32:36,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:32:36,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:32:36,714 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:32:36,714 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:32:36,714 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:32:36,715 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:32:36,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:32:36,715 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:32:36,715 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:32:36,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:32:36,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:32:36,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:32:36,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:32:36,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:32:36,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:32:36,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:32:36,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:32:36,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:32:36,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:32:36,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:32:36,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:32:36,719 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 -> 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df [2024-11-10 14:32:37,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:32:37,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:32:37,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:32:37,041 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:32:37,042 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:32:37,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2024-11-10 14:32:38,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:32:38,804 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:32:38,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2024-11-10 14:32:38,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7658425c/42a5776ebcd94a5e8bae4cfe446ed9c1/FLAGdaee9df49 [2024-11-10 14:32:39,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7658425c/42a5776ebcd94a5e8bae4cfe446ed9c1 [2024-11-10 14:32:39,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:32:39,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:32:39,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:32:39,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:32:39,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:32:39,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:32:39" (1/1) ... [2024-11-10 14:32:39,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4751287b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39, skipping insertion in model container [2024-11-10 14:32:39,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:32:39" (1/1) ... [2024-11-10 14:32:39,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:32:39,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:32:39,596 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:32:39,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:32:39,707 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:32:39,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39 WrapperNode [2024-11-10 14:32:39,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:32:39,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:32:39,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:32:39,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:32:39,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39" (1/1) ... [2024-11-10 14:32:39,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39" (1/1) ... [2024-11-10 14:32:39,768 INFO L138 Inliner]: procedures = 171, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2024-11-10 14:32:39,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:32:39,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:32:39,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:32:39,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:32:39,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39" (1/1) ... [2024-11-10 14:32:39,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39" (1/1) ... [2024-11-10 14:32:39,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39" (1/1) ... [2024-11-10 14:32:39,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39" (1/1) ... [2024-11-10 14:32:39,798 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39" (1/1) ... [2024-11-10 14:32:39,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39" (1/1) ... [2024-11-10 14:32:39,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39" (1/1) ... [2024-11-10 14:32:39,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39" (1/1) ... [2024-11-10 14:32:39,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:32:39,808 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:32:39,808 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:32:39,808 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:32:39,809 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39" (1/1) ... [2024-11-10 14:32:39,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:32:39,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:32:39,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:32:39,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:32:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:32:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:32:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:32:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:32:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:32:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 14:32:39,930 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 14:32:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:32:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:32:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:32:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:32:39,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:32:39,934 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:32:40,083 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:32:40,085 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:32:40,342 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L708: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-10 14:32:40,342 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-10 14:32:40,449 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:32:40,449 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:32:40,483 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:32:40,483 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:32:40,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:32:40 BoogieIcfgContainer [2024-11-10 14:32:40,484 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:32:40,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:32:40,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:32:40,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:32:40,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:32:39" (1/3) ... [2024-11-10 14:32:40,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae3b395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:32:40, skipping insertion in model container [2024-11-10 14:32:40,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:39" (2/3) ... [2024-11-10 14:32:40,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae3b395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:32:40, skipping insertion in model container [2024-11-10 14:32:40,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:32:40" (3/3) ... [2024-11-10 14:32:40,496 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2024-11-10 14:32:40,513 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:32:40,514 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-10 14:32:40,514 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:32:40,586 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:32:40,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 176 transitions, 359 flow [2024-11-10 14:32:40,708 INFO L124 PetriNetUnfolderBase]: 19/243 cut-off events. [2024-11-10 14:32:40,709 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:32:40,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 243 events. 19/243 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 755 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 136. Up to 4 conditions per place. [2024-11-10 14:32:40,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 176 transitions, 359 flow [2024-11-10 14:32:40,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 176 transitions, 359 flow [2024-11-10 14:32:40,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:40,751 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;@fe2026f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:40,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-10 14:32:40,772 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:40,773 INFO L124 PetriNetUnfolderBase]: 2/65 cut-off events. [2024-11-10 14:32:40,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:40,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:40,774 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] [2024-11-10 14:32:40,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:40,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:40,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1891897270, now seen corresponding path program 1 times [2024-11-10 14:32:40,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:40,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213741315] [2024-11-10 14:32:40,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:40,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:41,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:41,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213741315] [2024-11-10 14:32:41,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213741315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:41,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:41,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:41,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904784357] [2024-11-10 14:32:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:41,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:41,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:41,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:42,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 176 [2024-11-10 14:32:42,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 176 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:42,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:42,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 176 [2024-11-10 14:32:42,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:42,647 INFO L124 PetriNetUnfolderBase]: 579/2186 cut-off events. [2024-11-10 14:32:42,647 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:32:42,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3444 conditions, 2186 events. 579/2186 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 15322 event pairs, 357 based on Foata normal form. 300/2332 useless extension candidates. Maximal degree in co-relation 3292. Up to 1080 conditions per place. [2024-11-10 14:32:42,672 INFO L140 encePairwiseOnDemand]: 141/176 looper letters, 73 selfloop transitions, 70 changer transitions 0/255 dead transitions. [2024-11-10 14:32:42,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 255 transitions, 803 flow [2024-11-10 14:32:42,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:32:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:32:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2024-11-10 14:32:42,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8125 [2024-11-10 14:32:42,700 INFO L175 Difference]: Start difference. First operand has 166 places, 176 transitions, 359 flow. Second operand 6 states and 858 transitions. [2024-11-10 14:32:42,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 255 transitions, 803 flow [2024-11-10 14:32:42,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 255 transitions, 803 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:42,716 INFO L231 Difference]: Finished difference. Result has 174 places, 231 transitions, 793 flow [2024-11-10 14:32:42,718 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=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=793, PETRI_PLACES=174, PETRI_TRANSITIONS=231} [2024-11-10 14:32:42,722 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, 8 predicate places. [2024-11-10 14:32:42,723 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 231 transitions, 793 flow [2024-11-10 14:32:42,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:42,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:42,725 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] [2024-11-10 14:32:42,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:32:42,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:42,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:42,727 INFO L85 PathProgramCache]: Analyzing trace with hash -448830624, now seen corresponding path program 1 times [2024-11-10 14:32:42,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:42,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213196518] [2024-11-10 14:32:42,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:42,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:42,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:42,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213196518] [2024-11-10 14:32:42,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213196518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:42,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:42,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:32:42,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377619097] [2024-11-10 14:32:42,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:42,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:42,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:42,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:42,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:42,823 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 176 [2024-11-10 14:32:42,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 231 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:42,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:42,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 176 [2024-11-10 14:32:42,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:42,983 INFO L124 PetriNetUnfolderBase]: 188/1090 cut-off events. [2024-11-10 14:32:42,984 INFO L125 PetriNetUnfolderBase]: For 119/133 co-relation queries the response was YES. [2024-11-10 14:32:42,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1777 conditions, 1090 events. 188/1090 cut-off events. For 119/133 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6295 event pairs, 28 based on Foata normal form. 1/1019 useless extension candidates. Maximal degree in co-relation 1666. Up to 191 conditions per place. [2024-11-10 14:32:42,991 INFO L140 encePairwiseOnDemand]: 173/176 looper letters, 22 selfloop transitions, 3 changer transitions 0/237 dead transitions. [2024-11-10 14:32:42,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 237 transitions, 855 flow [2024-11-10 14:32:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2024-11-10 14:32:42,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8712121212121212 [2024-11-10 14:32:42,993 INFO L175 Difference]: Start difference. First operand has 174 places, 231 transitions, 793 flow. Second operand 3 states and 460 transitions. [2024-11-10 14:32:42,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 237 transitions, 855 flow [2024-11-10 14:32:42,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 237 transitions, 855 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:43,003 INFO L231 Difference]: Finished difference. Result has 177 places, 231 transitions, 804 flow [2024-11-10 14:32:43,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=177, PETRI_TRANSITIONS=231} [2024-11-10 14:32:43,004 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, 11 predicate places. [2024-11-10 14:32:43,004 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 231 transitions, 804 flow [2024-11-10 14:32:43,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:43,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:43,005 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] [2024-11-10 14:32:43,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:32:43,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:43,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:43,006 INFO L85 PathProgramCache]: Analyzing trace with hash 107974131, now seen corresponding path program 1 times [2024-11-10 14:32:43,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:43,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952714388] [2024-11-10 14:32:43,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:43,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:43,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:43,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952714388] [2024-11-10 14:32:43,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952714388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:43,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:43,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988528265] [2024-11-10 14:32:43,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:43,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:43,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:43,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:43,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:43,620 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 176 [2024-11-10 14:32:43,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 231 transitions, 804 flow. Second operand has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:43,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:43,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 176 [2024-11-10 14:32:43,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:43,972 INFO L124 PetriNetUnfolderBase]: 370/1612 cut-off events. [2024-11-10 14:32:43,973 INFO L125 PetriNetUnfolderBase]: For 469/488 co-relation queries the response was YES. [2024-11-10 14:32:43,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 1612 events. 370/1612 cut-off events. For 469/488 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 11103 event pairs, 99 based on Foata normal form. 2/1555 useless extension candidates. Maximal degree in co-relation 3167. Up to 642 conditions per place. [2024-11-10 14:32:43,984 INFO L140 encePairwiseOnDemand]: 158/176 looper letters, 112 selfloop transitions, 53 changer transitions 0/290 dead transitions. [2024-11-10 14:32:43,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 290 transitions, 1376 flow [2024-11-10 14:32:43,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:32:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:32:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions. [2024-11-10 14:32:43,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7831439393939394 [2024-11-10 14:32:43,988 INFO L175 Difference]: Start difference. First operand has 177 places, 231 transitions, 804 flow. Second operand 6 states and 827 transitions. [2024-11-10 14:32:43,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 290 transitions, 1376 flow [2024-11-10 14:32:43,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 290 transitions, 1370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:43,998 INFO L231 Difference]: Finished difference. Result has 185 places, 274 transitions, 1286 flow [2024-11-10 14:32:43,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1286, PETRI_PLACES=185, PETRI_TRANSITIONS=274} [2024-11-10 14:32:44,000 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, 19 predicate places. [2024-11-10 14:32:44,000 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 274 transitions, 1286 flow [2024-11-10 14:32:44,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:44,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:44,001 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:44,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:32:44,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:44,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:44,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1021345415, now seen corresponding path program 1 times [2024-11-10 14:32:44,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:44,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707209877] [2024-11-10 14:32:44,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:44,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:44,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:32:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:44,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:32:44,080 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:32:44,081 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-10 14:32:44,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-10 14:32:44,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-10 14:32:44,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-10 14:32:44,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-10 14:32:44,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-10 14:32:44,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-10 14:32:44,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-10 14:32:44,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-10 14:32:44,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-10 14:32:44,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-10 14:32:44,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-10 14:32:44,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:32:44,090 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 14:32:44,092 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:32:44,095 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:32:44,141 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:32:44,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 244 transitions, 504 flow [2024-11-10 14:32:44,205 INFO L124 PetriNetUnfolderBase]: 34/407 cut-off events. [2024-11-10 14:32:44,206 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:32:44,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 407 events. 34/407 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1542 event pairs, 0 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 245. Up to 8 conditions per place. [2024-11-10 14:32:44,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 244 transitions, 504 flow [2024-11-10 14:32:44,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 244 transitions, 504 flow [2024-11-10 14:32:44,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:44,214 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;@fe2026f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:44,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-10 14:32:44,218 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:44,219 INFO L124 PetriNetUnfolderBase]: 2/65 cut-off events. [2024-11-10 14:32:44,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:44,219 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:44,219 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] [2024-11-10 14:32:44,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:44,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:44,221 INFO L85 PathProgramCache]: Analyzing trace with hash 223121982, now seen corresponding path program 1 times [2024-11-10 14:32:44,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:44,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910261358] [2024-11-10 14:32:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:44,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:44,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910261358] [2024-11-10 14:32:44,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910261358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:44,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:44,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:44,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959544485] [2024-11-10 14:32:44,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:44,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:44,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:44,766 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 244 [2024-11-10 14:32:44,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 244 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:44,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:44,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 244 [2024-11-10 14:32:44,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:53,113 INFO L124 PetriNetUnfolderBase]: 29150/68689 cut-off events. [2024-11-10 14:32:53,114 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2024-11-10 14:32:53,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114223 conditions, 68689 events. 29150/68689 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 1189. Compared 769822 event pairs, 19147 based on Foata normal form. 11367/76034 useless extension candidates. Maximal degree in co-relation 99900. Up to 40547 conditions per place. [2024-11-10 14:32:53,583 INFO L140 encePairwiseOnDemand]: 187/244 looper letters, 122 selfloop transitions, 134 changer transitions 0/406 dead transitions. [2024-11-10 14:32:53,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 406 transitions, 1345 flow [2024-11-10 14:32:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:32:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:32:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1229 transitions. [2024-11-10 14:32:53,588 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8394808743169399 [2024-11-10 14:32:53,588 INFO L175 Difference]: Start difference. First operand has 229 places, 244 transitions, 504 flow. Second operand 6 states and 1229 transitions. [2024-11-10 14:32:53,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 406 transitions, 1345 flow [2024-11-10 14:32:53,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 406 transitions, 1345 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:53,615 INFO L231 Difference]: Finished difference. Result has 237 places, 357 transitions, 1342 flow [2024-11-10 14:32:53,616 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1342, PETRI_PLACES=237, PETRI_TRANSITIONS=357} [2024-11-10 14:32:53,616 INFO L277 CegarLoopForPetriNet]: 229 programPoint places, 8 predicate places. [2024-11-10 14:32:53,617 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 357 transitions, 1342 flow [2024-11-10 14:32:53,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:53,618 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:53,618 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] [2024-11-10 14:32:53,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:32:53,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:53,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash 919715680, now seen corresponding path program 1 times [2024-11-10 14:32:53,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:53,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251881010] [2024-11-10 14:32:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:53,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:53,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:53,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251881010] [2024-11-10 14:32:53,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251881010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:53,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:53,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:32:53,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563802618] [2024-11-10 14:32:53,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:53,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:53,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:53,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:53,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:53,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 244 [2024-11-10 14:32:53,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 357 transitions, 1342 flow. Second operand has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:53,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:53,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 244 [2024-11-10 14:32:53,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:57,347 INFO L124 PetriNetUnfolderBase]: 9819/31504 cut-off events. [2024-11-10 14:32:57,347 INFO L125 PetriNetUnfolderBase]: For 5113/5430 co-relation queries the response was YES. [2024-11-10 14:32:57,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55933 conditions, 31504 events. 9819/31504 cut-off events. For 5113/5430 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 359154 event pairs, 3954 based on Foata normal form. 1/28972 useless extension candidates. Maximal degree in co-relation 51780. Up to 9251 conditions per place. [2024-11-10 14:32:57,616 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 32 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2024-11-10 14:32:57,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 365 transitions, 1434 flow [2024-11-10 14:32:57,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2024-11-10 14:32:57,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8620218579234973 [2024-11-10 14:32:57,619 INFO L175 Difference]: Start difference. First operand has 237 places, 357 transitions, 1342 flow. Second operand 3 states and 631 transitions. [2024-11-10 14:32:57,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 365 transitions, 1434 flow [2024-11-10 14:32:57,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 365 transitions, 1434 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:57,764 INFO L231 Difference]: Finished difference. Result has 240 places, 359 transitions, 1367 flow [2024-11-10 14:32:57,765 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1367, PETRI_PLACES=240, PETRI_TRANSITIONS=359} [2024-11-10 14:32:57,766 INFO L277 CegarLoopForPetriNet]: 229 programPoint places, 11 predicate places. [2024-11-10 14:32:57,766 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 359 transitions, 1367 flow [2024-11-10 14:32:57,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:57,767 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:57,767 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] [2024-11-10 14:32:57,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:32:57,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:57,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:57,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1354606005, now seen corresponding path program 1 times [2024-11-10 14:32:57,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:57,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775304965] [2024-11-10 14:32:57,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:57,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:58,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:58,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775304965] [2024-11-10 14:32:58,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775304965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:58,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:58,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:58,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794963322] [2024-11-10 14:32:58,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:58,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:58,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:58,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:58,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:58,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 244 [2024-11-10 14:32:58,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 359 transitions, 1367 flow. Second operand has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:58,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:58,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 244 [2024-11-10 14:32:58,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:04,939 INFO L124 PetriNetUnfolderBase]: 21476/52880 cut-off events. [2024-11-10 14:33:04,940 INFO L125 PetriNetUnfolderBase]: For 18731/19832 co-relation queries the response was YES. [2024-11-10 14:33:05,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117731 conditions, 52880 events. 21476/52880 cut-off events. For 18731/19832 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 588342 event pairs, 8048 based on Foata normal form. 47/50281 useless extension candidates. Maximal degree in co-relation 117557. Up to 25420 conditions per place. [2024-11-10 14:33:05,668 INFO L140 encePairwiseOnDemand]: 218/244 looper letters, 192 selfloop transitions, 141 changer transitions 0/538 dead transitions. [2024-11-10 14:33:05,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 538 transitions, 2835 flow [2024-11-10 14:33:05,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1183 transitions. [2024-11-10 14:33:05,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8080601092896175 [2024-11-10 14:33:05,674 INFO L175 Difference]: Start difference. First operand has 240 places, 359 transitions, 1367 flow. Second operand 6 states and 1183 transitions. [2024-11-10 14:33:05,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 538 transitions, 2835 flow [2024-11-10 14:33:05,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 538 transitions, 2832 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:33:05,839 INFO L231 Difference]: Finished difference. Result has 249 places, 490 transitions, 2748 flow [2024-11-10 14:33:05,840 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2748, PETRI_PLACES=249, PETRI_TRANSITIONS=490} [2024-11-10 14:33:05,840 INFO L277 CegarLoopForPetriNet]: 229 programPoint places, 20 predicate places. [2024-11-10 14:33:05,840 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 490 transitions, 2748 flow [2024-11-10 14:33:05,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 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:05,841 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:05,842 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:05,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:33:05,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:33:05,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:05,843 INFO L85 PathProgramCache]: Analyzing trace with hash 295095671, now seen corresponding path program 1 times [2024-11-10 14:33:05,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:05,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304348477] [2024-11-10 14:33:05,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:05,941 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:05,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:05,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304348477] [2024-11-10 14:33:05,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304348477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:33:05,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701495903] [2024-11-10 14:33:05,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:05,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:05,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:05,946 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:05,950 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:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:06,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:33:06,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:33:06,109 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:06,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:33:06,180 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:06,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701495903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:33:06,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:33:06,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:33:06,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423938703] [2024-11-10 14:33:06,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:33:06,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:33:06,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:06,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:33:06,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:33:06,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 244 [2024-11-10 14:33:06,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 490 transitions, 2748 flow. Second operand has 10 states, 10 states have (on average 198.3) internal successors, (1983), 10 states have internal predecessors, (1983), 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:06,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:06,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 244 [2024-11-10 14:33:06,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:10,338 INFO L124 PetriNetUnfolderBase]: 12555/33927 cut-off events. [2024-11-10 14:33:10,339 INFO L125 PetriNetUnfolderBase]: For 23739/25792 co-relation queries the response was YES. [2024-11-10 14:33:10,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83938 conditions, 33927 events. 12555/33927 cut-off events. For 23739/25792 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 355294 event pairs, 1800 based on Foata normal form. 199/32502 useless extension candidates. Maximal degree in co-relation 34327. Up to 13029 conditions per place. [2024-11-10 14:33:10,622 INFO L140 encePairwiseOnDemand]: 239/244 looper letters, 72 selfloop transitions, 9 changer transitions 0/496 dead transitions. [2024-11-10 14:33:10,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 496 transitions, 2914 flow [2024-11-10 14:33:10,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:33:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 14:33:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1845 transitions. [2024-11-10 14:33:10,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8401639344262295 [2024-11-10 14:33:10,626 INFO L175 Difference]: Start difference. First operand has 249 places, 490 transitions, 2748 flow. Second operand 9 states and 1845 transitions. [2024-11-10 14:33:10,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 496 transitions, 2914 flow [2024-11-10 14:33:10,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 496 transitions, 2896 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:11,002 INFO L231 Difference]: Finished difference. Result has 207 places, 440 transitions, 2640 flow [2024-11-10 14:33:11,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=2618, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2640, PETRI_PLACES=207, PETRI_TRANSITIONS=440} [2024-11-10 14:33:11,004 INFO L277 CegarLoopForPetriNet]: 229 programPoint places, -22 predicate places. [2024-11-10 14:33:11,004 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 440 transitions, 2640 flow [2024-11-10 14:33:11,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 198.3) internal successors, (1983), 10 states have internal predecessors, (1983), 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:11,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:11,006 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:11,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:33:11,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:11,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:33:11,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:11,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1748278306, now seen corresponding path program 1 times [2024-11-10 14:33:11,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:11,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012805070] [2024-11-10 14:33:11,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:11,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:11,549 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:11,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012805070] [2024-11-10 14:33:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012805070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:11,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:11,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:11,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718771454] [2024-11-10 14:33:11,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:11,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:11,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:11,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:11,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:11,838 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 244 [2024-11-10 14:33:11,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 440 transitions, 2640 flow. Second operand has 6 states, 6 states have (on average 156.16666666666666) internal successors, (937), 6 states have internal predecessors, (937), 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:11,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:11,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 244 [2024-11-10 14:33:11,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:17,154 INFO L124 PetriNetUnfolderBase]: 19385/43860 cut-off events. [2024-11-10 14:33:17,155 INFO L125 PetriNetUnfolderBase]: For 43348/45733 co-relation queries the response was YES. [2024-11-10 14:33:17,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130209 conditions, 43860 events. 19385/43860 cut-off events. For 43348/45733 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 438599 event pairs, 5110 based on Foata normal form. 41/42167 useless extension candidates. Maximal degree in co-relation 111015. Up to 28120 conditions per place. [2024-11-10 14:33:17,776 INFO L140 encePairwiseOnDemand]: 217/244 looper letters, 338 selfloop transitions, 213 changer transitions 0/671 dead transitions. [2024-11-10 14:33:17,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 671 transitions, 5084 flow [2024-11-10 14:33:17,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1090 transitions. [2024-11-10 14:33:17,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.744535519125683 [2024-11-10 14:33:17,780 INFO L175 Difference]: Start difference. First operand has 207 places, 440 transitions, 2640 flow. Second operand 6 states and 1090 transitions. [2024-11-10 14:33:17,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 671 transitions, 5084 flow [2024-11-10 14:33:18,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 671 transitions, 5061 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-10 14:33:18,157 INFO L231 Difference]: Finished difference. Result has 212 places, 643 transitions, 4927 flow [2024-11-10 14:33:18,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=2617, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4927, PETRI_PLACES=212, PETRI_TRANSITIONS=643} [2024-11-10 14:33:18,159 INFO L277 CegarLoopForPetriNet]: 229 programPoint places, -17 predicate places. [2024-11-10 14:33:18,159 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 643 transitions, 4927 flow [2024-11-10 14:33:18,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 156.16666666666666) internal successors, (937), 6 states have internal predecessors, (937), 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:18,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:18,160 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:18,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:33:18,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:33:18,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash 552507292, now seen corresponding path program 1 times [2024-11-10 14:33:18,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:18,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539315297] [2024-11-10 14:33:18,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:18,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 14:33:18,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:18,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539315297] [2024-11-10 14:33:18,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539315297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:33:18,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652279775] [2024-11-10 14:33:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:18,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:18,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:18,810 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:18,812 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:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:18,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 14:33:18,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:33:19,056 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 14:33:19,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 14:33:19,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 14:33:19,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-10 14:33:19,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:33:19,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-10 14:33:19,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:33:19,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-10 14:33:19,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-10 14:33:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 14:33:19,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:33:19,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_267 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)))) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 3 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))))) is different from false [2024-11-10 14:33:19,783 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 3 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet16#1|)))) (and (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)))))))) is different from false [2024-11-10 14:33:19,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:33:19,940 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-10 14:33:19,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:33:19,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 35 [2024-11-10 14:33:19,962 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:33:19,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-10 14:33:19,974 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:33:19,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-10 14:33:19,983 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:33:19,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-10 14:33:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 7 trivial. 1 not checked. [2024-11-10 14:33:25,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652279775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:33:25,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:33:25,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-11-10 14:33:25,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398669622] [2024-11-10 14:33:25,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:33:25,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 14:33:25,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:25,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 14:33:25,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=252, Unknown=25, NotChecked=70, Total=420 [2024-11-10 14:33:26,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 244 [2024-11-10 14:33:26,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 643 transitions, 4927 flow. Second operand has 21 states, 21 states have (on average 112.19047619047619) internal successors, (2356), 21 states have internal predecessors, (2356), 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:26,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:26,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 244 [2024-11-10 14:33:26,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:44,065 INFO L124 PetriNetUnfolderBase]: 56162/112025 cut-off events. [2024-11-10 14:33:44,065 INFO L125 PetriNetUnfolderBase]: For 145316/148714 co-relation queries the response was YES. [2024-11-10 14:33:44,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346585 conditions, 112025 events. 56162/112025 cut-off events. For 145316/148714 co-relation queries the response was YES. Maximal size of possible extension queue 1430. Compared 1140653 event pairs, 11945 based on Foata normal form. 2183/109126 useless extension candidates. Maximal degree in co-relation 303232. Up to 64432 conditions per place. [2024-11-10 14:33:45,186 INFO L140 encePairwiseOnDemand]: 201/244 looper letters, 428 selfloop transitions, 566 changer transitions 0/1077 dead transitions. [2024-11-10 14:33:45,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 1077 transitions, 9762 flow [2024-11-10 14:33:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 14:33:45,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 14:33:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1519 transitions. [2024-11-10 14:33:45,191 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6225409836065574 [2024-11-10 14:33:45,192 INFO L175 Difference]: Start difference. First operand has 212 places, 643 transitions, 4927 flow. Second operand 10 states and 1519 transitions. [2024-11-10 14:33:45,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 1077 transitions, 9762 flow [2024-11-10 14:33:46,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 1077 transitions, 9402 flow, removed 180 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:46,891 INFO L231 Difference]: Finished difference. Result has 224 places, 888 transitions, 9180 flow [2024-11-10 14:33:46,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=4695, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=321, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9180, PETRI_PLACES=224, PETRI_TRANSITIONS=888} [2024-11-10 14:33:46,892 INFO L277 CegarLoopForPetriNet]: 229 programPoint places, -5 predicate places. [2024-11-10 14:33:46,893 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 888 transitions, 9180 flow [2024-11-10 14:33:46,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 112.19047619047619) internal successors, (2356), 21 states have internal predecessors, (2356), 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,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:46,894 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:46,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 14:33:47,095 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,SelfDestructingSolverStorable9 [2024-11-10 14:33:47,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:33:47,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2039564018, now seen corresponding path program 2 times [2024-11-10 14:33:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:47,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599473949] [2024-11-10 14:33:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat