./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.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/02-base_24-malloc_races.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 10776deb9ece8603196e8eecaf972964a6cae8e272af6ac2269e1894470ceda6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:27:54,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:27:54,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:27:54,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:27:54,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:27:54,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:27:54,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:27:54,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:27:54,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:27:54,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:27:54,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:27:54,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:27:54,938 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:27:54,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:27:54,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:27:54,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:27:54,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:27:54,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:27:54,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:27:54,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:27:54,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:27:54,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:27:54,943 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:27:54,943 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:27:54,944 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:27:54,944 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:27:54,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:27:54,944 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:27:54,945 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:27:54,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:27:54,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:27:54,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:27:54,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:27:54,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:27:54,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:27:54,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:27:54,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:27:54,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:27:54,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:27:54,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:27:54,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:27:54,948 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 -> 10776deb9ece8603196e8eecaf972964a6cae8e272af6ac2269e1894470ceda6 [2024-11-10 14:27:55,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:27:55,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:27:55,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:27:55,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:27:55,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:27:55,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i [2024-11-10 14:27:56,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:27:56,930 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:27:56,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i [2024-11-10 14:27:56,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32feaa236/237e408e955b4fbda0ff8ef3cfc12de7/FLAG1e236ea8a [2024-11-10 14:27:57,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32feaa236/237e408e955b4fbda0ff8ef3cfc12de7 [2024-11-10 14:27:57,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:27:57,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:27:57,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:27:57,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:27:57,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:27:57,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:27:57" (1/1) ... [2024-11-10 14:27:57,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5906d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:57, skipping insertion in model container [2024-11-10 14:27:57,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:27:57" (1/1) ... [2024-11-10 14:27:57,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:27:57,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:27:57,907 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:27:57,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:27:58,053 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:27:58,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:58 WrapperNode [2024-11-10 14:27:58,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:27:58,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:27:58,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:27:58,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:27:58,063 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:27:58" (1/1) ... [2024-11-10 14:27:58,085 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:27:58" (1/1) ... [2024-11-10 14:27:58,110 INFO L138 Inliner]: procedures = 365, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2024-11-10 14:27:58,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:27:58,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:27:58,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:27:58,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:27:58,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:58" (1/1) ... [2024-11-10 14:27:58,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:58" (1/1) ... [2024-11-10 14:27:58,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:58" (1/1) ... [2024-11-10 14:27:58,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:58" (1/1) ... [2024-11-10 14:27:58,135 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:58" (1/1) ... [2024-11-10 14:27:58,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:58" (1/1) ... [2024-11-10 14:27:58,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:58" (1/1) ... [2024-11-10 14:27:58,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:58" (1/1) ... [2024-11-10 14:27:58,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:27:58,143 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:27:58,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:27:58,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:27:58,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:58" (1/1) ... [2024-11-10 14:27:58,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:27:58,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:27:58,179 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:27:58,184 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:27:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:27:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:27:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:27:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:27:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:27:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:27:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 14:27:58,238 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 14:27:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:27:58,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:27:58,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:27:58,240 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:27:58,399 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:27:58,402 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:27:58,635 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:27:58,635 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:27:58,668 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:27:58,670 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:27:58,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:27:58 BoogieIcfgContainer [2024-11-10 14:27:58,671 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:27:58,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:27:58,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:27:58,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:27:58,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:27:57" (1/3) ... [2024-11-10 14:27:58,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b21f29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:27:58, skipping insertion in model container [2024-11-10 14:27:58,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:58" (2/3) ... [2024-11-10 14:27:58,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b21f29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:27:58, skipping insertion in model container [2024-11-10 14:27:58,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:27:58" (3/3) ... [2024-11-10 14:27:58,682 INFO L112 eAbstractionObserver]: Analyzing ICFG 02-base_24-malloc_races.i [2024-11-10 14:27:58,699 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:27:58,701 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-10 14:27:58,701 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:27:58,768 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:27:58,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 102 transitions, 208 flow [2024-11-10 14:27:58,860 INFO L124 PetriNetUnfolderBase]: 0/101 cut-off events. [2024-11-10 14:27:58,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:27:58,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 101 events. 0/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-11-10 14:27:58,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 102 transitions, 208 flow [2024-11-10 14:27:58,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 101 transitions, 205 flow [2024-11-10 14:27:58,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:27:58,922 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;@29f86cda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:27:58,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-10 14:27:58,930 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:27:58,946 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2024-11-10 14:27:58,946 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:27:58,947 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:58,949 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:27:58,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:27:58,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash -679629968, now seen corresponding path program 1 times [2024-11-10 14:27:58,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:58,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369297759] [2024-11-10 14:27:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:59,236 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:27:59,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:59,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369297759] [2024-11-10 14:27:59,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369297759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:59,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:59,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:27:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062882308] [2024-11-10 14:27:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:59,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:27:59,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:59,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:27:59,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:27:59,307 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2024-11-10 14:27:59,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 101 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:27:59,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:59,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2024-11-10 14:27:59,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:59,378 INFO L124 PetriNetUnfolderBase]: 12/232 cut-off events. [2024-11-10 14:27:59,379 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:27:59,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 232 events. 12/232 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 687 event pairs, 12 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 230. Up to 36 conditions per place. [2024-11-10 14:27:59,388 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 11 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2024-11-10 14:27:59,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 100 transitions, 229 flow [2024-11-10 14:27:59,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:27:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:27:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2024-11-10 14:27:59,404 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2024-11-10 14:27:59,406 INFO L175 Difference]: Start difference. First operand has 105 places, 101 transitions, 205 flow. Second operand 3 states and 278 transitions. [2024-11-10 14:27:59,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 100 transitions, 229 flow [2024-11-10 14:27:59,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 100 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:27:59,415 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 206 flow [2024-11-10 14:27:59,419 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2024-11-10 14:27:59,423 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 0 predicate places. [2024-11-10 14:27:59,424 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 206 flow [2024-11-10 14:27:59,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:27:59,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:59,426 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] [2024-11-10 14:27:59,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:27:59,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:27:59,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1784905220, now seen corresponding path program 1 times [2024-11-10 14:27:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:59,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895450075] [2024-11-10 14:27:59,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:59,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:59,510 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:27:59,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:59,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895450075] [2024-11-10 14:27:59,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895450075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:59,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:59,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:27:59,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204120263] [2024-11-10 14:27:59,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:59,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:27:59,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:59,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:27:59,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:27:59,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2024-11-10 14:27:59,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:27:59,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:59,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2024-11-10 14:27:59,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:59,613 INFO L124 PetriNetUnfolderBase]: 12/231 cut-off events. [2024-11-10 14:27:59,613 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:27:59,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 231 events. 12/231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 710 event pairs, 12 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 248. Up to 36 conditions per place. [2024-11-10 14:27:59,619 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 11 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2024-11-10 14:27:59,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 230 flow [2024-11-10 14:27:59,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:27:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:27:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2024-11-10 14:27:59,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2024-11-10 14:27:59,625 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 206 flow. Second operand 3 states and 278 transitions. [2024-11-10 14:27:59,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 230 flow [2024-11-10 14:27:59,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 99 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:27:59,632 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 204 flow [2024-11-10 14:27:59,634 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2024-11-10 14:27:59,634 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, -1 predicate places. [2024-11-10 14:27:59,637 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 204 flow [2024-11-10 14:27:59,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:27:59,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:59,638 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:27:59,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:27:59,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:27:59,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:59,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1152546185, now seen corresponding path program 1 times [2024-11-10 14:27:59,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:59,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899698309] [2024-11-10 14:27:59,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:59,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:59,731 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:27:59,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:59,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899698309] [2024-11-10 14:27:59,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899698309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:59,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:59,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:27:59,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985452459] [2024-11-10 14:27:59,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:59,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:27:59,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:59,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:27:59,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:27:59,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 102 [2024-11-10 14:27:59,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:27:59,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:59,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 102 [2024-11-10 14:27:59,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:59,830 INFO L124 PetriNetUnfolderBase]: 16/262 cut-off events. [2024-11-10 14:27:59,831 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:27:59,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 262 events. 16/262 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 910 event pairs, 7 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 277. Up to 36 conditions per place. [2024-11-10 14:27:59,834 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 12 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-11-10 14:27:59,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 236 flow [2024-11-10 14:27:59,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:27:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:27:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2024-11-10 14:27:59,837 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.934640522875817 [2024-11-10 14:27:59,837 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 204 flow. Second operand 3 states and 286 transitions. [2024-11-10 14:27:59,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 236 flow [2024-11-10 14:27:59,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 101 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:27:59,840 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 210 flow [2024-11-10 14:27:59,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2024-11-10 14:27:59,841 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, -2 predicate places. [2024-11-10 14:27:59,842 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 210 flow [2024-11-10 14:27:59,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:27:59,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:59,842 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:27:59,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:27:59,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:27:59,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1258739281, now seen corresponding path program 1 times [2024-11-10 14:27:59,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:59,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38641974] [2024-11-10 14:27:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:59,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:28:00,496 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:28:00,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:28:00,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38641974] [2024-11-10 14:28:00,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38641974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:28:00,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:28:00,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:28:00,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338704972] [2024-11-10 14:28:00,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:28:00,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:28:00,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:28:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:28:00,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:28:00,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 102 [2024-11-10 14:28:00,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 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:28:00,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:28:00,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 102 [2024-11-10 14:28:00,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:00,928 INFO L124 PetriNetUnfolderBase]: 231/883 cut-off events. [2024-11-10 14:28:00,929 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:28:00,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 883 events. 231/883 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5208 event pairs, 96 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 1360. Up to 348 conditions per place. [2024-11-10 14:28:00,938 INFO L140 encePairwiseOnDemand]: 86/102 looper letters, 51 selfloop transitions, 41 changer transitions 0/163 dead transitions. [2024-11-10 14:28:00,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 163 transitions, 522 flow [2024-11-10 14:28:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:28:00,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:28:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions. [2024-11-10 14:28:00,943 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8774509803921569 [2024-11-10 14:28:00,943 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 210 flow. Second operand 6 states and 537 transitions. [2024-11-10 14:28:00,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 163 transitions, 522 flow [2024-11-10 14:28:00,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 163 transitions, 522 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:28:00,949 INFO L231 Difference]: Finished difference. Result has 112 places, 141 transitions, 468 flow [2024-11-10 14:28:00,950 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=112, PETRI_TRANSITIONS=141} [2024-11-10 14:28:00,951 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 7 predicate places. [2024-11-10 14:28:00,951 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 141 transitions, 468 flow [2024-11-10 14:28:00,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 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:28:00,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:00,952 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:28:00,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:28:00,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:28:00,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:00,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1474058199, now seen corresponding path program 1 times [2024-11-10 14:28:00,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:00,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139768802] [2024-11-10 14:28:00,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:00,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:28:01,295 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:28:01,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:28:01,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139768802] [2024-11-10 14:28:01,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139768802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:28:01,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:28:01,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:28:01,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526097013] [2024-11-10 14:28:01,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:28:01,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:28:01,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:28:01,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:28:01,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:28:01,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2024-11-10 14:28:01,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 141 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:28:01,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:28:01,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2024-11-10 14:28:01,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:01,711 INFO L124 PetriNetUnfolderBase]: 285/1200 cut-off events. [2024-11-10 14:28:01,711 INFO L125 PetriNetUnfolderBase]: For 369/443 co-relation queries the response was YES. [2024-11-10 14:28:01,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2467 conditions, 1200 events. 285/1200 cut-off events. For 369/443 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8267 event pairs, 29 based on Foata normal form. 31/1165 useless extension candidates. Maximal degree in co-relation 2422. Up to 272 conditions per place. [2024-11-10 14:28:01,719 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 71 selfloop transitions, 48 changer transitions 0/216 dead transitions. [2024-11-10 14:28:01,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 216 transitions, 970 flow [2024-11-10 14:28:01,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:28:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:28:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2024-11-10 14:28:01,723 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9264705882352942 [2024-11-10 14:28:01,723 INFO L175 Difference]: Start difference. First operand has 112 places, 141 transitions, 468 flow. Second operand 6 states and 567 transitions. [2024-11-10 14:28:01,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 216 transitions, 970 flow [2024-11-10 14:28:01,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 216 transitions, 970 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:28:01,733 INFO L231 Difference]: Finished difference. Result has 122 places, 187 transitions, 874 flow [2024-11-10 14:28:01,733 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=874, PETRI_PLACES=122, PETRI_TRANSITIONS=187} [2024-11-10 14:28:01,736 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 17 predicate places. [2024-11-10 14:28:01,736 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 187 transitions, 874 flow [2024-11-10 14:28:01,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:28:01,737 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:01,738 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] [2024-11-10 14:28:01,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:28:01,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:28:01,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:01,740 INFO L85 PathProgramCache]: Analyzing trace with hash 257742717, now seen corresponding path program 1 times [2024-11-10 14:28:01,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:01,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236464190] [2024-11-10 14:28:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:01,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:28:01,778 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:28:01,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:28:01,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236464190] [2024-11-10 14:28:01,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236464190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:28:01,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:28:01,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:28:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132036524] [2024-11-10 14:28:01,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:28:01,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:28:01,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:28:01,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:28:01,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:28:01,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 102 [2024-11-10 14:28:01,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 187 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:28:01,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:28:01,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 102 [2024-11-10 14:28:01,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:01,937 INFO L124 PetriNetUnfolderBase]: 231/1142 cut-off events. [2024-11-10 14:28:01,938 INFO L125 PetriNetUnfolderBase]: For 654/729 co-relation queries the response was YES. [2024-11-10 14:28:01,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 1142 events. 231/1142 cut-off events. For 654/729 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8008 event pairs, 24 based on Foata normal form. 14/1112 useless extension candidates. Maximal degree in co-relation 2406. Up to 215 conditions per place. [2024-11-10 14:28:01,946 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 13 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2024-11-10 14:28:01,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 190 transitions, 910 flow [2024-11-10 14:28:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:28:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:28:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2024-11-10 14:28:01,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2024-11-10 14:28:01,948 INFO L175 Difference]: Start difference. First operand has 122 places, 187 transitions, 874 flow. Second operand 3 states and 287 transitions. [2024-11-10 14:28:01,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 190 transitions, 910 flow [2024-11-10 14:28:01,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 190 transitions, 902 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-11-10 14:28:01,963 INFO L231 Difference]: Finished difference. Result has 123 places, 187 transitions, 876 flow [2024-11-10 14:28:01,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=123, PETRI_TRANSITIONS=187} [2024-11-10 14:28:01,964 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 18 predicate places. [2024-11-10 14:28:01,964 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 187 transitions, 876 flow [2024-11-10 14:28:01,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:28:01,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:01,965 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] [2024-11-10 14:28:01,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:28:01,965 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:28:01,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:01,965 INFO L85 PathProgramCache]: Analyzing trace with hash 147545616, now seen corresponding path program 1 times [2024-11-10 14:28:01,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:01,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785827370] [2024-11-10 14:28:01,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:01,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:28:02,039 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:28:02,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:28:02,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785827370] [2024-11-10 14:28:02,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785827370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:28:02,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:28:02,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:28:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139066368] [2024-11-10 14:28:02,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:28:02,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:28:02,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:28:02,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:28:02,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:28:02,053 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 102 [2024-11-10 14:28:02,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 187 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:28:02,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:28:02,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 102 [2024-11-10 14:28:02,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:02,096 INFO L124 PetriNetUnfolderBase]: 40/302 cut-off events. [2024-11-10 14:28:02,097 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-10 14:28:02,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 302 events. 40/302 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1114 event pairs, 4 based on Foata normal form. 2/292 useless extension candidates. Maximal degree in co-relation 523. Up to 68 conditions per place. [2024-11-10 14:28:02,099 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 2 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2024-11-10 14:28:02,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 120 transitions, 422 flow [2024-11-10 14:28:02,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:28:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:28:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2024-11-10 14:28:02,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9673202614379085 [2024-11-10 14:28:02,100 INFO L175 Difference]: Start difference. First operand has 123 places, 187 transitions, 876 flow. Second operand 3 states and 296 transitions. [2024-11-10 14:28:02,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 120 transitions, 422 flow [2024-11-10 14:28:02,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 120 transitions, 372 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-11-10 14:28:02,104 INFO L231 Difference]: Finished difference. Result has 116 places, 120 transitions, 368 flow [2024-11-10 14:28:02,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=116, PETRI_TRANSITIONS=120} [2024-11-10 14:28:02,105 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 11 predicate places. [2024-11-10 14:28:02,106 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 120 transitions, 368 flow [2024-11-10 14:28:02,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:28:02,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:02,107 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] [2024-11-10 14:28:02,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:28:02,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:28:02,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:02,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1002698101, now seen corresponding path program 1 times [2024-11-10 14:28:02,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:02,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690884418] [2024-11-10 14:28:02,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:28:02,402 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:28:02,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:28:02,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690884418] [2024-11-10 14:28:02,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690884418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:28:02,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:28:02,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:28:02,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294264550] [2024-11-10 14:28:02,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:28:02,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:28:02,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:28:02,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:28:02,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:28:02,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 102 [2024-11-10 14:28:02,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 120 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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:28:02,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:28:02,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 102 [2024-11-10 14:28:02,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:02,646 INFO L124 PetriNetUnfolderBase]: 142/645 cut-off events. [2024-11-10 14:28:02,646 INFO L125 PetriNetUnfolderBase]: For 114/129 co-relation queries the response was YES. [2024-11-10 14:28:02,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 645 events. 142/645 cut-off events. For 114/129 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3462 event pairs, 35 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 1226. Up to 231 conditions per place. [2024-11-10 14:28:02,649 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 59 selfloop transitions, 25 changer transitions 4/160 dead transitions. [2024-11-10 14:28:02,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 160 transitions, 656 flow [2024-11-10 14:28:02,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:28:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:28:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2024-11-10 14:28:02,652 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8382352941176471 [2024-11-10 14:28:02,652 INFO L175 Difference]: Start difference. First operand has 116 places, 120 transitions, 368 flow. Second operand 6 states and 513 transitions. [2024-11-10 14:28:02,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 160 transitions, 656 flow [2024-11-10 14:28:02,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 160 transitions, 652 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:28:02,657 INFO L231 Difference]: Finished difference. Result has 124 places, 145 transitions, 552 flow [2024-11-10 14:28:02,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=124, PETRI_TRANSITIONS=145} [2024-11-10 14:28:02,658 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 19 predicate places. [2024-11-10 14:28:02,658 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 145 transitions, 552 flow [2024-11-10 14:28:02,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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:28:02,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:02,660 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] [2024-11-10 14:28:02,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:28:02,660 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:28:02,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash -558609189, now seen corresponding path program 1 times [2024-11-10 14:28:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:02,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129182853] [2024-11-10 14:28:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:28:02,930 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:28:02,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:28:02,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129182853] [2024-11-10 14:28:02,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129182853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:28:02,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:28:02,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:28:02,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287019219] [2024-11-10 14:28:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:28:02,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:28:02,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:28:02,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:28:02,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:28:03,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2024-11-10 14:28:03,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 145 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 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:28:03,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:28:03,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2024-11-10 14:28:03,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:03,289 INFO L124 PetriNetUnfolderBase]: 204/839 cut-off events. [2024-11-10 14:28:03,289 INFO L125 PetriNetUnfolderBase]: For 456/476 co-relation queries the response was YES. [2024-11-10 14:28:03,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 839 events. 204/839 cut-off events. For 456/476 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5005 event pairs, 16 based on Foata normal form. 22/859 useless extension candidates. Maximal degree in co-relation 2122. Up to 239 conditions per place. [2024-11-10 14:28:03,295 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 65 selfloop transitions, 51 changer transitions 24/219 dead transitions. [2024-11-10 14:28:03,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 219 transitions, 1178 flow [2024-11-10 14:28:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:28:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:28:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 563 transitions. [2024-11-10 14:28:03,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199346405228758 [2024-11-10 14:28:03,297 INFO L175 Difference]: Start difference. First operand has 124 places, 145 transitions, 552 flow. Second operand 6 states and 563 transitions. [2024-11-10 14:28:03,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 219 transitions, 1178 flow [2024-11-10 14:28:03,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 219 transitions, 1164 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-11-10 14:28:03,304 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 922 flow [2024-11-10 14:28:03,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=922, PETRI_PLACES=133, PETRI_TRANSITIONS=179} [2024-11-10 14:28:03,305 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 28 predicate places. [2024-11-10 14:28:03,305 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 179 transitions, 922 flow [2024-11-10 14:28:03,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 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:28:03,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:03,306 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] [2024-11-10 14:28:03,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:28:03,306 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:28:03,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:03,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1746213959, now seen corresponding path program 1 times [2024-11-10 14:28:03,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:03,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539881466] [2024-11-10 14:28:03,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:03,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:28:03,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:28:03,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:28:03,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539881466] [2024-11-10 14:28:03,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539881466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:28:03,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:28:03,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 14:28:03,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677787375] [2024-11-10 14:28:03,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:28:03,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 14:28:03,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:28:03,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 14:28:03,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 14:28:04,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 102 [2024-11-10 14:28:04,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 179 transitions, 922 flow. Second operand has 11 states, 11 states have (on average 68.27272727272727) internal successors, (751), 11 states have internal predecessors, (751), 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:28:04,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:28:04,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 102 [2024-11-10 14:28:04,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:04,410 INFO L124 PetriNetUnfolderBase]: 220/863 cut-off events. [2024-11-10 14:28:04,410 INFO L125 PetriNetUnfolderBase]: For 1084/1111 co-relation queries the response was YES. [2024-11-10 14:28:04,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2700 conditions, 863 events. 220/863 cut-off events. For 1084/1111 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5357 event pairs, 46 based on Foata normal form. 12/857 useless extension candidates. Maximal degree in co-relation 2635. Up to 299 conditions per place. [2024-11-10 14:28:04,416 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 94 selfloop transitions, 31 changer transitions 4/205 dead transitions. [2024-11-10 14:28:04,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 205 transitions, 1408 flow [2024-11-10 14:28:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:28:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:28:04,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 848 transitions. [2024-11-10 14:28:04,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6928104575163399 [2024-11-10 14:28:04,419 INFO L175 Difference]: Start difference. First operand has 133 places, 179 transitions, 922 flow. Second operand 12 states and 848 transitions. [2024-11-10 14:28:04,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 205 transitions, 1408 flow [2024-11-10 14:28:04,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 205 transitions, 1359 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-11-10 14:28:04,430 INFO L231 Difference]: Finished difference. Result has 139 places, 178 transitions, 931 flow [2024-11-10 14:28:04,430 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=931, PETRI_PLACES=139, PETRI_TRANSITIONS=178} [2024-11-10 14:28:04,431 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 34 predicate places. [2024-11-10 14:28:04,431 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 178 transitions, 931 flow [2024-11-10 14:28:04,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 68.27272727272727) internal successors, (751), 11 states have internal predecessors, (751), 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:28:04,432 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:04,432 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] [2024-11-10 14:28:04,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:28:04,432 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:28:04,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:04,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1258885712, now seen corresponding path program 1 times [2024-11-10 14:28:04,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:04,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750391983] [2024-11-10 14:28:04,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:04,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:28:04,822 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:28:04,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:28:04,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750391983] [2024-11-10 14:28:04,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750391983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:28:04,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:28:04,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 14:28:04,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101607937] [2024-11-10 14:28:04,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:28:04,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 14:28:04,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:28:04,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 14:28:04,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 14:28:05,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 102 [2024-11-10 14:28:05,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 178 transitions, 931 flow. Second operand has 11 states, 11 states have (on average 73.72727272727273) internal successors, (811), 11 states have internal predecessors, (811), 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:28:05,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:28:05,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 102 [2024-11-10 14:28:05,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:05,832 INFO L124 PetriNetUnfolderBase]: 219/829 cut-off events. [2024-11-10 14:28:05,832 INFO L125 PetriNetUnfolderBase]: For 1112/1146 co-relation queries the response was YES. [2024-11-10 14:28:05,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2748 conditions, 829 events. 219/829 cut-off events. For 1112/1146 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5051 event pairs, 20 based on Foata normal form. 18/836 useless extension candidates. Maximal degree in co-relation 2679. Up to 177 conditions per place. [2024-11-10 14:28:05,837 INFO L140 encePairwiseOnDemand]: 85/102 looper letters, 95 selfloop transitions, 59 changer transitions 12/236 dead transitions. [2024-11-10 14:28:05,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 236 transitions, 1662 flow [2024-11-10 14:28:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:28:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:28:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 959 transitions. [2024-11-10 14:28:05,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7834967320261438 [2024-11-10 14:28:05,840 INFO L175 Difference]: Start difference. First operand has 139 places, 178 transitions, 931 flow. Second operand 12 states and 959 transitions. [2024-11-10 14:28:05,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 236 transitions, 1662 flow [2024-11-10 14:28:05,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 236 transitions, 1560 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-11-10 14:28:05,850 INFO L231 Difference]: Finished difference. Result has 144 places, 185 transitions, 1160 flow [2024-11-10 14:28:05,851 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1160, PETRI_PLACES=144, PETRI_TRANSITIONS=185} [2024-11-10 14:28:05,851 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 39 predicate places. [2024-11-10 14:28:05,852 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 185 transitions, 1160 flow [2024-11-10 14:28:05,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 73.72727272727273) internal successors, (811), 11 states have internal predecessors, (811), 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:28:05,852 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:05,852 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:28:05,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:28:05,852 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-10 14:28:05,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash 598437334, now seen corresponding path program 1 times [2024-11-10 14:28:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:05,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705977054] [2024-11-10 14:28:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:28:05,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:28:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:28:05,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:28:05,915 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:28:05,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-11-10 14:28:05,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-10 14:28:05,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-10 14:28:05,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-10 14:28:05,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-10 14:28:05,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-10 14:28:05,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2024-11-10 14:28:05,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-10 14:28:05,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-10 14:28:05,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-10 14:28:05,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-10 14:28:05,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-10 14:28:05,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-10 14:28:05,922 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-10 14:28:05,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-10 14:28:05,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:28:05,925 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:28:05,990 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:28:05,990 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:28:05,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:28:05 BasicIcfg [2024-11-10 14:28:05,996 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:28:05,997 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:28:05,997 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:28:05,997 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:28:05,998 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:27:58" (3/4) ... [2024-11-10 14:28:05,999 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 14:28:06,060 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:28:06,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:28:06,061 INFO L158 Benchmark]: Toolchain (without parser) took 8853.43ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 151.8MB in the beginning and 190.1MB in the end (delta: -38.3MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-10 14:28:06,061 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:28:06,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 845.49ms. Allocated memory is still 186.6MB. Free memory was 150.7MB in the beginning and 109.4MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-10 14:28:06,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.72ms. Allocated memory is still 186.6MB. Free memory was 109.4MB in the beginning and 107.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:28:06,062 INFO L158 Benchmark]: Boogie Preprocessor took 30.78ms. Allocated memory is still 186.6MB. Free memory was 107.3MB in the beginning and 105.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:28:06,063 INFO L158 Benchmark]: IcfgBuilder took 528.14ms. Allocated memory is still 186.6MB. Free memory was 105.2MB in the beginning and 87.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 14:28:06,063 INFO L158 Benchmark]: TraceAbstraction took 7322.77ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 86.3MB in the beginning and 197.4MB in the end (delta: -111.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:28:06,063 INFO L158 Benchmark]: Witness Printer took 63.29ms. Allocated memory is still 270.5MB. Free memory was 197.4MB in the beginning and 190.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 14:28:06,065 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 845.49ms. Allocated memory is still 186.6MB. Free memory was 150.7MB in the beginning and 109.4MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.72ms. Allocated memory is still 186.6MB. Free memory was 109.4MB in the beginning and 107.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.78ms. Allocated memory is still 186.6MB. Free memory was 107.3MB in the beginning and 105.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 528.14ms. Allocated memory is still 186.6MB. Free memory was 105.2MB in the beginning and 87.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7322.77ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 86.3MB in the beginning and 197.4MB in the end (delta: -111.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 63.29ms. Allocated memory is still 270.5MB. Free memory was 197.4MB in the beginning and 190.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1241]: Data race detected Data race detected The following path leads to a data race: [L1223] 0 int *x; VAL [x={0:0}] [L1224] 0 int *y; VAL [x={0:0}, y={0:0}] [L1225] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [m={1:0}, x={0:0}, y={0:0}] [L1234] 0 pthread_t id; VAL [m={1:0}, x={0:0}, y={0:0}] [L1235] 0 x = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={0:0}] [L1236] 0 y = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={-3:0}] [L1237] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1239] EXPR 0 *x VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1239] EXPR 0 \read(*x) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1239] 0 printf("%d\n",*x) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1228] EXPR 1 *x VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1228] 1 *x = 3 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1241] EXPR 0 *y VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1241] EXPR 0 \read(*y) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1228] 1 *x = 3 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1229] EXPR 1 *y VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1229] 1 *y = 8 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1241] 0 printf("%d\n",*y) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: x = malloc(sizeof(int)) [1235] * C: y = malloc(sizeof(int)) [1236] and C: printf("%d\n",*y) [1241] - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1236]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 136 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 852 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 580 mSDsluCounter, 395 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2896 IncrementalHoareTripleChecker+Invalid, 3106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 90 mSDtfsCounter, 2896 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1160occurred in iteration=11, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 504 ConstructedInterpolants, 0 QuantifiedInterpolants, 1645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 14:28:06,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE