/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/goblint-regression/04-mutex_37-indirect_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 06:57:34,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 06:57:34,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 06:57:34,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 06:57:34,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 06:57:34,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 06:57:34,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 06:57:34,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 06:57:34,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 06:57:34,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 06:57:34,419 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 06:57:34,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 06:57:34,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 06:57:34,419 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 06:57:34,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 06:57:34,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 06:57:34,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 06:57:34,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 06:57:34,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 06:57:34,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 06:57:34,421 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 06:57:34,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 06:57:34,421 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 06:57:34,421 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 06:57:34,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 06:57:34,422 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 06:57:34,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 06:57:34,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 06:57:34,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 06:57:34,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 06:57:34,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 06:57:34,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 06:57:34,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 06:57:34,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 06:57:34,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 06:57:34,424 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-26 06:57:34,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 06:57:34,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 06:57:34,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 06:57:34,665 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 06:57:34,666 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 06:57:34,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_37-indirect_rc.i [2023-08-26 06:57:35,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 06:57:35,885 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 06:57:35,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_37-indirect_rc.i [2023-08-26 06:57:35,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6991b1dae/4f5c859050e24946a5bfe4f5b49aa6f0/FLAGc0453aa78 [2023-08-26 06:57:35,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6991b1dae/4f5c859050e24946a5bfe4f5b49aa6f0 [2023-08-26 06:57:35,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 06:57:35,923 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 06:57:35,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 06:57:35,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 06:57:35,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 06:57:35,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:57:35" (1/1) ... [2023-08-26 06:57:35,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359b951a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:35, skipping insertion in model container [2023-08-26 06:57:35,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:57:35" (1/1) ... [2023-08-26 06:57:35,981 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 06:57:36,223 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 06:57:36,234 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 06:57:36,257 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 06:57:36,258 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 06:57:36,275 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 06:57:36,307 INFO L206 MainTranslator]: Completed translation [2023-08-26 06:57:36,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:36 WrapperNode [2023-08-26 06:57:36,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 06:57:36,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 06:57:36,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 06:57:36,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 06:57:36,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:36" (1/1) ... [2023-08-26 06:57:36,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:36" (1/1) ... [2023-08-26 06:57:36,361 INFO L138 Inliner]: procedures = 162, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-08-26 06:57:36,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 06:57:36,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 06:57:36,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 06:57:36,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 06:57:36,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:36" (1/1) ... [2023-08-26 06:57:36,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:36" (1/1) ... [2023-08-26 06:57:36,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:36" (1/1) ... [2023-08-26 06:57:36,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:36" (1/1) ... [2023-08-26 06:57:36,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:36" (1/1) ... [2023-08-26 06:57:36,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:36" (1/1) ... [2023-08-26 06:57:36,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:36" (1/1) ... [2023-08-26 06:57:36,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:36" (1/1) ... [2023-08-26 06:57:36,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 06:57:36,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 06:57:36,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 06:57:36,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 06:57:36,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:36" (1/1) ... [2023-08-26 06:57:36,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 06:57:36,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 06:57:36,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 06:57:36,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 06:57:36,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 06:57:36,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 06:57:36,491 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 06:57:36,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 06:57:36,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 06:57:36,492 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 06:57:36,492 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 06:57:36,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 06:57:36,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 06:57:36,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 06:57:36,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 06:57:36,493 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 06:57:36,581 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 06:57:36,583 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 06:57:36,722 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 06:57:36,727 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 06:57:36,728 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 06:57:36,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:57:36 BoogieIcfgContainer [2023-08-26 06:57:36,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 06:57:36,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 06:57:36,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 06:57:36,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 06:57:36,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:57:35" (1/3) ... [2023-08-26 06:57:36,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e56f4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:57:36, skipping insertion in model container [2023-08-26 06:57:36,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:57:36" (2/3) ... [2023-08-26 06:57:36,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e56f4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:57:36, skipping insertion in model container [2023-08-26 06:57:36,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:57:36" (3/3) ... [2023-08-26 06:57:36,735 INFO L112 eAbstractionObserver]: Analyzing ICFG 04-mutex_37-indirect_rc.i [2023-08-26 06:57:36,749 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 06:57:36,749 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 06:57:36,749 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 06:57:36,795 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-26 06:57:36,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 105 transitions, 218 flow [2023-08-26 06:57:36,847 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2023-08-26 06:57:36,847 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 06:57:36,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 104 events. 0/104 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2023-08-26 06:57:36,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 105 transitions, 218 flow [2023-08-26 06:57:36,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 97 transitions, 197 flow [2023-08-26 06:57:36,855 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 06:57:36,861 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 97 transitions, 197 flow [2023-08-26 06:57:36,863 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 97 transitions, 197 flow [2023-08-26 06:57:36,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 97 transitions, 197 flow [2023-08-26 06:57:36,879 INFO L124 PetriNetUnfolderBase]: 0/97 cut-off events. [2023-08-26 06:57:36,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 06:57:36,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 97 events. 0/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2023-08-26 06:57:36,881 INFO L119 LiptonReduction]: Number of co-enabled transitions 1736 [2023-08-26 06:57:38,587 INFO L134 LiptonReduction]: Checked pairs total: 10756 [2023-08-26 06:57:38,587 INFO L136 LiptonReduction]: Total number of compositions: 72 [2023-08-26 06:57:38,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 06:57:38,600 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@1e96ef2f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 06:57:38,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-08-26 06:57:38,602 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 06:57:38,602 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 06:57:38,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 06:57:38,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 06:57:38,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 06:57:38,603 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-08-26 06:57:38,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 06:57:38,606 INFO L85 PathProgramCache]: Analyzing trace with hash 341, now seen corresponding path program 1 times [2023-08-26 06:57:38,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 06:57:38,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292356869] [2023-08-26 06:57:38,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 06:57:38,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 06:57:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 06:57:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 06:57:38,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 06:57:38,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292356869] [2023-08-26 06:57:38,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292356869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 06:57:38,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 06:57:38,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 06:57:38,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318102369] [2023-08-26 06:57:38,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 06:57:38,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 06:57:38,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 06:57:38,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 06:57:38,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 06:57:38,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 177 [2023-08-26 06:57:38,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 87 flow. Second operand has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 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) [2023-08-26 06:57:38,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 06:57:38,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 177 [2023-08-26 06:57:38,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 06:57:38,750 INFO L124 PetriNetUnfolderBase]: 20/141 cut-off events. [2023-08-26 06:57:38,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 06:57:38,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 141 events. 20/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 516 event pairs, 20 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 188. Up to 52 conditions per place. [2023-08-26 06:57:38,753 INFO L140 encePairwiseOnDemand]: 172/177 looper letters, 11 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2023-08-26 06:57:38,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 99 flow [2023-08-26 06:57:38,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 06:57:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 06:57:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 222 transitions. [2023-08-26 06:57:38,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6271186440677966 [2023-08-26 06:57:38,764 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 222 transitions. [2023-08-26 06:57:38,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 222 transitions. [2023-08-26 06:57:38,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 06:57:38,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 222 transitions. [2023-08-26 06:57:38,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 111.0) internal successors, (222), 2 states have internal predecessors, (222), 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) [2023-08-26 06:57:38,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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) [2023-08-26 06:57:38,777 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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) [2023-08-26 06:57:38,779 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 87 flow. Second operand 2 states and 222 transitions. [2023-08-26 06:57:38,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 99 flow [2023-08-26 06:57:38,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 06:57:38,783 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 76 flow [2023-08-26 06:57:38,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-26 06:57:38,788 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2023-08-26 06:57:38,788 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 76 flow [2023-08-26 06:57:38,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 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) [2023-08-26 06:57:38,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 06:57:38,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 06:57:38,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 06:57:38,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-08-26 06:57:38,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 06:57:38,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1911164474, now seen corresponding path program 1 times [2023-08-26 06:57:38,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 06:57:38,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878515697] [2023-08-26 06:57:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 06:57:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 06:57:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 06:57:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 06:57:39,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 06:57:39,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878515697] [2023-08-26 06:57:39,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878515697] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 06:57:39,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 06:57:39,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 06:57:39,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990834264] [2023-08-26 06:57:39,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 06:57:39,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 06:57:39,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 06:57:39,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 06:57:39,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 06:57:39,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 177 [2023-08-26 06:57:39,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 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) [2023-08-26 06:57:39,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 06:57:39,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 177 [2023-08-26 06:57:39,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 06:57:39,509 INFO L124 PetriNetUnfolderBase]: 295/635 cut-off events. [2023-08-26 06:57:39,510 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 06:57:39,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 635 events. 295/635 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2692 event pairs, 184 based on Foata normal form. 0/552 useless extension candidates. Maximal degree in co-relation 1269. Up to 489 conditions per place. [2023-08-26 06:57:39,518 INFO L140 encePairwiseOnDemand]: 166/177 looper letters, 72 selfloop transitions, 22 changer transitions 0/95 dead transitions. [2023-08-26 06:57:39,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 95 transitions, 380 flow [2023-08-26 06:57:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 06:57:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 06:57:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 503 transitions. [2023-08-26 06:57:39,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4736346516007533 [2023-08-26 06:57:39,523 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 503 transitions. [2023-08-26 06:57:39,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 503 transitions. [2023-08-26 06:57:39,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 06:57:39,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 503 transitions. [2023-08-26 06:57:39,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 06:57:39,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 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) [2023-08-26 06:57:39,529 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 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) [2023-08-26 06:57:39,529 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 76 flow. Second operand 6 states and 503 transitions. [2023-08-26 06:57:39,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 95 transitions, 380 flow [2023-08-26 06:57:39,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 95 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 06:57:39,531 INFO L231 Difference]: Finished difference. Result has 51 places, 58 transitions, 226 flow [2023-08-26 06:57:39,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=51, PETRI_TRANSITIONS=58} [2023-08-26 06:57:39,532 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2023-08-26 06:57:39,532 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 58 transitions, 226 flow [2023-08-26 06:57:39,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 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) [2023-08-26 06:57:39,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 06:57:39,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 06:57:39,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 06:57:39,534 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-08-26 06:57:39,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 06:57:39,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1559680124, now seen corresponding path program 1 times [2023-08-26 06:57:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 06:57:39,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502565101] [2023-08-26 06:57:39,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 06:57:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 06:57:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 06:57:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 06:57:39,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 06:57:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502565101] [2023-08-26 06:57:39,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502565101] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 06:57:39,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 06:57:39,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 06:57:39,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917056668] [2023-08-26 06:57:39,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 06:57:39,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 06:57:39,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 06:57:39,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 06:57:39,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 06:57:39,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 177 [2023-08-26 06:57:39,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 58 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 70.33333333333333) internal successors, (422), 6 states have internal predecessors, (422), 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) [2023-08-26 06:57:39,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 06:57:39,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 177 [2023-08-26 06:57:39,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 06:57:39,919 INFO L124 PetriNetUnfolderBase]: 361/775 cut-off events. [2023-08-26 06:57:39,919 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2023-08-26 06:57:39,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 775 events. 361/775 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3578 event pairs, 124 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 1873. Up to 547 conditions per place. [2023-08-26 06:57:39,922 INFO L140 encePairwiseOnDemand]: 166/177 looper letters, 113 selfloop transitions, 26 changer transitions 0/140 dead transitions. [2023-08-26 06:57:39,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 140 transitions, 758 flow [2023-08-26 06:57:39,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 06:57:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 06:57:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 533 transitions. [2023-08-26 06:57:39,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018832391713748 [2023-08-26 06:57:39,924 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 533 transitions. [2023-08-26 06:57:39,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 533 transitions. [2023-08-26 06:57:39,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 06:57:39,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 533 transitions. [2023-08-26 06:57:39,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 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) [2023-08-26 06:57:39,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 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) [2023-08-26 06:57:39,930 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 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) [2023-08-26 06:57:39,930 INFO L175 Difference]: Start difference. First operand has 51 places, 58 transitions, 226 flow. Second operand 6 states and 533 transitions. [2023-08-26 06:57:39,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 140 transitions, 758 flow [2023-08-26 06:57:39,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 140 transitions, 758 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 06:57:39,942 INFO L231 Difference]: Finished difference. Result has 61 places, 79 transitions, 410 flow [2023-08-26 06:57:39,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=61, PETRI_TRANSITIONS=79} [2023-08-26 06:57:39,944 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2023-08-26 06:57:39,946 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 79 transitions, 410 flow [2023-08-26 06:57:39,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.33333333333333) internal successors, (422), 6 states have internal predecessors, (422), 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) [2023-08-26 06:57:39,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 06:57:39,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 06:57:39,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 06:57:39,948 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-08-26 06:57:39,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 06:57:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash 528533091, now seen corresponding path program 1 times [2023-08-26 06:57:39,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 06:57:39,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696269472] [2023-08-26 06:57:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 06:57:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 06:57:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 06:57:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 06:57:40,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 06:57:40,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696269472] [2023-08-26 06:57:40,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696269472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 06:57:40,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 06:57:40,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 06:57:40,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260577168] [2023-08-26 06:57:40,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 06:57:40,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 06:57:40,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 06:57:40,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 06:57:40,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 06:57:40,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 177 [2023-08-26 06:57:40,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 79 transitions, 410 flow. Second operand has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 6 states have internal predecessors, (404), 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) [2023-08-26 06:57:40,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 06:57:40,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 177 [2023-08-26 06:57:40,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 06:57:40,309 INFO L124 PetriNetUnfolderBase]: 405/880 cut-off events. [2023-08-26 06:57:40,309 INFO L125 PetriNetUnfolderBase]: For 729/729 co-relation queries the response was YES. [2023-08-26 06:57:40,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 880 events. 405/880 cut-off events. For 729/729 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4283 event pairs, 155 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 2592. Up to 741 conditions per place. [2023-08-26 06:57:40,314 INFO L140 encePairwiseOnDemand]: 162/177 looper letters, 93 selfloop transitions, 53 changer transitions 0/147 dead transitions. [2023-08-26 06:57:40,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 147 transitions, 998 flow [2023-08-26 06:57:40,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 06:57:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 06:57:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2023-08-26 06:57:40,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455743879472693 [2023-08-26 06:57:40,336 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 484 transitions. [2023-08-26 06:57:40,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 484 transitions. [2023-08-26 06:57:40,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 06:57:40,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 484 transitions. [2023-08-26 06:57:40,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 06:57:40,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 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) [2023-08-26 06:57:40,339 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 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) [2023-08-26 06:57:40,339 INFO L175 Difference]: Start difference. First operand has 61 places, 79 transitions, 410 flow. Second operand 6 states and 484 transitions. [2023-08-26 06:57:40,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 147 transitions, 998 flow [2023-08-26 06:57:40,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 147 transitions, 998 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 06:57:40,344 INFO L231 Difference]: Finished difference. Result has 71 places, 126 transitions, 892 flow [2023-08-26 06:57:40,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=892, PETRI_PLACES=71, PETRI_TRANSITIONS=126} [2023-08-26 06:57:40,344 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2023-08-26 06:57:40,344 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 126 transitions, 892 flow [2023-08-26 06:57:40,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 6 states have internal predecessors, (404), 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) [2023-08-26 06:57:40,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 06:57:40,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 06:57:40,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 06:57:40,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-08-26 06:57:40,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 06:57:40,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1451770614, now seen corresponding path program 1 times [2023-08-26 06:57:40,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 06:57:40,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522589365] [2023-08-26 06:57:40,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 06:57:40,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 06:57:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 06:57:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 06:57:40,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 06:57:40,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522589365] [2023-08-26 06:57:40,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522589365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 06:57:40,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 06:57:40,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 06:57:40,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399474269] [2023-08-26 06:57:40,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 06:57:40,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 06:57:40,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 06:57:40,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 06:57:40,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 06:57:40,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 177 [2023-08-26 06:57:40,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 126 transitions, 892 flow. Second operand has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 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) [2023-08-26 06:57:40,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 06:57:40,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 177 [2023-08-26 06:57:40,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 06:57:40,693 INFO L124 PetriNetUnfolderBase]: 501/1073 cut-off events. [2023-08-26 06:57:40,693 INFO L125 PetriNetUnfolderBase]: For 1599/1601 co-relation queries the response was YES. [2023-08-26 06:57:40,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3838 conditions, 1073 events. 501/1073 cut-off events. For 1599/1601 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5444 event pairs, 146 based on Foata normal form. 0/1018 useless extension candidates. Maximal degree in co-relation 3820. Up to 913 conditions per place. [2023-08-26 06:57:40,699 INFO L140 encePairwiseOnDemand]: 159/177 looper letters, 143 selfloop transitions, 76 changer transitions 4/224 dead transitions. [2023-08-26 06:57:40,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 224 transitions, 1800 flow [2023-08-26 06:57:40,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 06:57:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 06:57:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 523 transitions. [2023-08-26 06:57:40,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924670433145009 [2023-08-26 06:57:40,703 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 523 transitions. [2023-08-26 06:57:40,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 523 transitions. [2023-08-26 06:57:40,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 06:57:40,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 523 transitions. [2023-08-26 06:57:40,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 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) [2023-08-26 06:57:40,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 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) [2023-08-26 06:57:40,705 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 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) [2023-08-26 06:57:40,705 INFO L175 Difference]: Start difference. First operand has 71 places, 126 transitions, 892 flow. Second operand 6 states and 523 transitions. [2023-08-26 06:57:40,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 224 transitions, 1800 flow [2023-08-26 06:57:40,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 224 transitions, 1736 flow, removed 32 selfloop flow, removed 0 redundant places. [2023-08-26 06:57:40,714 INFO L231 Difference]: Finished difference. Result has 80 places, 188 transitions, 1431 flow [2023-08-26 06:57:40,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1431, PETRI_PLACES=80, PETRI_TRANSITIONS=188} [2023-08-26 06:57:40,715 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 34 predicate places. [2023-08-26 06:57:40,715 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 188 transitions, 1431 flow [2023-08-26 06:57:40,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 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) [2023-08-26 06:57:40,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 06:57:40,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 06:57:40,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 06:57:40,715 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-08-26 06:57:40,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 06:57:40,716 INFO L85 PathProgramCache]: Analyzing trace with hash -350749789, now seen corresponding path program 1 times [2023-08-26 06:57:40,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 06:57:40,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81664361] [2023-08-26 06:57:40,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 06:57:40,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 06:57:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 06:57:40,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 06:57:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 06:57:40,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 06:57:40,748 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 06:57:40,749 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2023-08-26 06:57:40,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2023-08-26 06:57:40,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2023-08-26 06:57:40,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2023-08-26 06:57:40,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2023-08-26 06:57:40,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2023-08-26 06:57:40,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2023-08-26 06:57:40,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2023-08-26 06:57:40,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2023-08-26 06:57:40,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2023-08-26 06:57:40,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2023-08-26 06:57:40,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2023-08-26 06:57:40,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2023-08-26 06:57:40,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2023-08-26 06:57:40,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 06:57:40,751 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-26 06:57:40,755 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 06:57:40,755 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 06:57:40,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:57:40 BasicIcfg [2023-08-26 06:57:40,774 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 06:57:40,774 INFO L158 Benchmark]: Toolchain (without parser) took 4851.11ms. Allocated memory was 354.4MB in the beginning and 461.4MB in the end (delta: 107.0MB). Free memory was 312.7MB in the beginning and 282.6MB in the end (delta: 30.1MB). Peak memory consumption was 139.1MB. Max. memory is 16.0GB. [2023-08-26 06:57:40,774 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 354.4MB. Free memory is still 331.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 06:57:40,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.92ms. Allocated memory is still 354.4MB. Free memory was 312.7MB in the beginning and 293.3MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 06:57:40,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.24ms. Allocated memory is still 354.4MB. Free memory was 293.3MB in the beginning and 291.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 06:57:40,775 INFO L158 Benchmark]: Boogie Preprocessor took 47.63ms. Allocated memory is still 354.4MB. Free memory was 291.4MB in the beginning and 289.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 06:57:40,775 INFO L158 Benchmark]: RCFGBuilder took 319.04ms. Allocated memory is still 354.4MB. Free memory was 289.3MB in the beginning and 319.4MB in the end (delta: -30.2MB). Peak memory consumption was 9.5MB. Max. memory is 16.0GB. [2023-08-26 06:57:40,775 INFO L158 Benchmark]: TraceAbstraction took 4043.13ms. Allocated memory was 354.4MB in the beginning and 461.4MB in the end (delta: 107.0MB). Free memory was 318.9MB in the beginning and 282.6MB in the end (delta: 36.3MB). Peak memory consumption was 144.3MB. Max. memory is 16.0GB. [2023-08-26 06:57:40,781 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.11ms. Allocated memory is still 354.4MB. Free memory is still 331.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 384.92ms. Allocated memory is still 354.4MB. Free memory was 312.7MB in the beginning and 293.3MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.24ms. Allocated memory is still 354.4MB. Free memory was 293.3MB in the beginning and 291.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.63ms. Allocated memory is still 354.4MB. Free memory was 291.4MB in the beginning and 289.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 319.04ms. Allocated memory is still 354.4MB. Free memory was 289.3MB in the beginning and 319.4MB in the end (delta: -30.2MB). Peak memory consumption was 9.5MB. Max. memory is 16.0GB. * TraceAbstraction took 4043.13ms. Allocated memory was 354.4MB in the beginning and 461.4MB in the end (delta: 107.0MB). Free memory was 318.9MB in the beginning and 282.6MB in the end (delta: 36.3MB). Peak memory consumption was 144.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 101 PlacesBefore, 46 PlacesAfterwards, 97 TransitionsBefore, 42 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 72 TotalNumberOfCompositions, 10756 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2157, independent: 1651, independent conditional: 0, independent unconditional: 1651, dependent: 506, dependent conditional: 0, dependent unconditional: 506, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 691, independent: 650, independent conditional: 0, independent unconditional: 650, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2157, independent: 1001, independent conditional: 0, independent unconditional: 1001, dependent: 465, dependent conditional: 0, dependent unconditional: 465, unknown: 691, unknown conditional: 0, unknown unconditional: 691] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - DataRaceFoundResult [Line: 685]: Data race detected Data race detected The following path leads to a data race: [L679] 0 int g; [L680] 0 int *g1; [L681] 0 int *g2; [L682] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L690] 0 pthread_t id; [L691] 0 int x; [L692] EXPR 0 g2 = &g [L692] 0 g1 = g2 = &g [L693] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id={5:0}, mutex={2:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1] [L694] EXPR 0 *g2 [L694] EXPR 0 \read(*g2) VAL [\read(*g2)=0, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id={5:0}, mutex={2:0}] [L685] EXPR 1 *g1 [L685] EXPR 1 \read(*g1) VAL [\read(*g1)=0, arg={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\read(*g1)=0, \read(*g2)=0, arg={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id={5:0}, mutex={2:0}] [L685] 1 (*g1)++ VAL [\read(*g1)=0, arg={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\read(*g1)=0, \read(*g2)=0, arg={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id={5:0}, mutex={2:0}] [L685] 1 (*g1)++ VAL [\read(*g1)=0, arg={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\read(*g1)=0, \read(*g2)=0, arg={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id={5:0}, mutex={2:0}] [L685] 1 (*g1)++ VAL [\read(*g1)=0, arg={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\read(*g1)=0, \read(*g2)=0, arg={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id={5:0}, mutex={2:0}] [L685] 1 (*g1)++ VAL [\read(*g1)=0, arg={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [(*g2)++=0, (*g2)++=25, \read(*g1)=0, \read(*g2)=0, arg={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id={5:0}, mutex={2:0}] [L685] 1 (*g1)++ VAL [\read(*g1)=0, arg={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2: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: g2 = &g [692] * C: g1 = g2 = &g [692] * C: (*g2)++ [694] and C: (*g1)++ [685] - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 685]: 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, 14 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: 3.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 109 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 932 IncrementalHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 84 mSDtfsCounter, 932 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1431occurred in iteration=5, InterpolantAutomatonStates: 26, 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, 0.8s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 364 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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! [2023-08-26 06:57:40,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...