/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 -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/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 05:47:34,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 05:47:35,057 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-25 05:47:35,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 05:47:35,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 05:47:35,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 05:47:35,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 05:47:35,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 05:47:35,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 05:47:35,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 05:47:35,097 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 05:47:35,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 05:47:35,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 05:47:35,099 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 05:47:35,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 05:47:35,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 05:47:35,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 05:47:35,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 05:47:35,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 05:47:35,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 05:47:35,100 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 05:47:35,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 05:47:35,101 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 05:47:35,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 05:47:35,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 05:47:35,102 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 05:47:35,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 05:47:35,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 05:47:35,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 05:47:35,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 05:47:35,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 05:47:35,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 05:47:35,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 05:47:35,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 05:47:35,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 05:47:35,105 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.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-25 05:47:35,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 05:47:35,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 05:47:35,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 05:47:35,409 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 05:47:35,409 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 05:47:35,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-08-25 05:47:36,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 05:47:36,765 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 05:47:36,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-08-25 05:47:36,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b7c35190/7282f9c75d6a4093b9aeea984296e67e/FLAGe8a74c28a [2023-08-25 05:47:36,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b7c35190/7282f9c75d6a4093b9aeea984296e67e [2023-08-25 05:47:36,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 05:47:36,784 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 05:47:36,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 05:47:36,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 05:47:36,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 05:47:36,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 05:47:36" (1/1) ... [2023-08-25 05:47:36,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18bd22f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:36, skipping insertion in model container [2023-08-25 05:47:36,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 05:47:36" (1/1) ... [2023-08-25 05:47:36,807 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 05:47:36,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 05:47:36,979 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 05:47:37,003 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 05:47:37,010 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 05:47:37,010 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 05:47:37,016 INFO L206 MainTranslator]: Completed translation [2023-08-25 05:47:37,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:37 WrapperNode [2023-08-25 05:47:37,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 05:47:37,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 05:47:37,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 05:47:37,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 05:47:37,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:37" (1/1) ... [2023-08-25 05:47:37,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:37" (1/1) ... [2023-08-25 05:47:37,061 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 210 [2023-08-25 05:47:37,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 05:47:37,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 05:47:37,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 05:47:37,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 05:47:37,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:37" (1/1) ... [2023-08-25 05:47:37,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:37" (1/1) ... [2023-08-25 05:47:37,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:37" (1/1) ... [2023-08-25 05:47:37,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:37" (1/1) ... [2023-08-25 05:47:37,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:37" (1/1) ... [2023-08-25 05:47:37,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:37" (1/1) ... [2023-08-25 05:47:37,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:37" (1/1) ... [2023-08-25 05:47:37,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:37" (1/1) ... [2023-08-25 05:47:37,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 05:47:37,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 05:47:37,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 05:47:37,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 05:47:37,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:37" (1/1) ... [2023-08-25 05:47:37,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 05:47:37,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 05:47:37,119 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-25 05:47:37,127 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-25 05:47:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 05:47:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 05:47:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 05:47:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 05:47:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 05:47:37,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 05:47:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 05:47:37,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 05:47:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 05:47:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 05:47:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 05:47:37,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 05:47:37,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 05:47:37,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 05:47:37,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 05:47:37,152 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 05:47:37,265 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 05:47:37,266 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 05:47:37,643 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 05:47:37,792 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 05:47:37,792 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-25 05:47:37,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 05:47:37 BoogieIcfgContainer [2023-08-25 05:47:37,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 05:47:37,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 05:47:37,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 05:47:37,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 05:47:37,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 05:47:36" (1/3) ... [2023-08-25 05:47:37,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44397ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 05:47:37, skipping insertion in model container [2023-08-25 05:47:37,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:47:37" (2/3) ... [2023-08-25 05:47:37,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44397ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 05:47:37, skipping insertion in model container [2023-08-25 05:47:37,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 05:47:37" (3/3) ... [2023-08-25 05:47:37,802 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-08-25 05:47:37,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 05:47:37,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-25 05:47:37,817 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 05:47:37,887 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-25 05:47:37,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 165 transitions, 346 flow [2023-08-25 05:47:37,964 INFO L124 PetriNetUnfolderBase]: 9/163 cut-off events. [2023-08-25 05:47:37,964 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 05:47:37,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 163 events. 9/163 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 165 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-08-25 05:47:37,969 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 165 transitions, 346 flow [2023-08-25 05:47:37,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 154 transitions, 320 flow [2023-08-25 05:47:37,976 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 05:47:37,984 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 154 transitions, 320 flow [2023-08-25 05:47:37,987 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 154 transitions, 320 flow [2023-08-25 05:47:37,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 154 transitions, 320 flow [2023-08-25 05:47:38,020 INFO L124 PetriNetUnfolderBase]: 9/154 cut-off events. [2023-08-25 05:47:38,020 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 05:47:38,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 154 events. 9/154 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 162 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-08-25 05:47:38,030 INFO L119 LiptonReduction]: Number of co-enabled transitions 1976 [2023-08-25 05:47:42,313 INFO L134 LiptonReduction]: Checked pairs total: 11180 [2023-08-25 05:47:42,313 INFO L136 LiptonReduction]: Total number of compositions: 138 [2023-08-25 05:47:42,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 05:47:42,328 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;@c2faa1e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 05:47:42,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-08-25 05:47:42,330 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 05:47:42,330 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 05:47:42,330 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 05:47:42,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 05:47:42,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 05:47:42,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-08-25 05:47:42,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 05:47:42,334 INFO L85 PathProgramCache]: Analyzing trace with hash 750, now seen corresponding path program 1 times [2023-08-25 05:47:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 05:47:42,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297071759] [2023-08-25 05:47:42,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 05:47:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 05:47:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 05:47:42,417 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-25 05:47:42,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 05:47:42,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297071759] [2023-08-25 05:47:42,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297071759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 05:47:42,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 05:47:42,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 05:47:42,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953048230] [2023-08-25 05:47:42,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 05:47:42,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 05:47:42,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 05:47:42,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 05:47:42,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 05:47:42,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 303 [2023-08-25 05:47:42,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 112 flow. Second operand has 2 states, 2 states have (on average 142.5) internal successors, (285), 2 states have internal predecessors, (285), 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-25 05:47:42,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 05:47:42,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 303 [2023-08-25 05:47:42,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 05:47:42,537 INFO L124 PetriNetUnfolderBase]: 75/243 cut-off events. [2023-08-25 05:47:42,538 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-25 05:47:42,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 243 events. 75/243 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1184 event pairs, 38 based on Foata normal form. 35/231 useless extension candidates. Maximal degree in co-relation 303. Up to 124 conditions per place. [2023-08-25 05:47:42,540 INFO L140 encePairwiseOnDemand]: 288/303 looper letters, 17 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2023-08-25 05:47:42,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 116 flow [2023-08-25 05:47:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 05:47:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 05:47:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 316 transitions. [2023-08-25 05:47:42,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5214521452145214 [2023-08-25 05:47:42,552 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 316 transitions. [2023-08-25 05:47:42,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 316 transitions. [2023-08-25 05:47:42,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 05:47:42,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 316 transitions. [2023-08-25 05:47:42,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.0) internal successors, (316), 2 states have internal predecessors, (316), 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-25 05:47:42,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 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-25 05:47:42,562 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 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-25 05:47:42,564 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 112 flow. Second operand 2 states and 316 transitions. [2023-08-25 05:47:42,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 116 flow [2023-08-25 05:47:42,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 05:47:42,568 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 74 flow [2023-08-25 05:47:42,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2023-08-25 05:47:42,572 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -16 predicate places. [2023-08-25 05:47:42,572 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 74 flow [2023-08-25 05:47:42,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 142.5) internal successors, (285), 2 states have internal predecessors, (285), 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-25 05:47:42,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 05:47:42,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 05:47:42,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 05:47:42,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-08-25 05:47:42,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 05:47:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash 724999694, now seen corresponding path program 1 times [2023-08-25 05:47:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 05:47:42,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916850874] [2023-08-25 05:47:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 05:47:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 05:47:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 05:47:42,690 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-25 05:47:42,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 05:47:42,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916850874] [2023-08-25 05:47:42,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916850874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 05:47:42,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 05:47:42,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 05:47:42,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307565419] [2023-08-25 05:47:42,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 05:47:42,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 05:47:42,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 05:47:42,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 05:47:42,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 05:47:42,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 303 [2023-08-25 05:47:42,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-25 05:47:42,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 05:47:42,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 303 [2023-08-25 05:47:42,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 05:47:42,759 INFO L124 PetriNetUnfolderBase]: 128/298 cut-off events. [2023-08-25 05:47:42,759 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-25 05:47:42,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 298 events. 128/298 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1215 event pairs, 99 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 530. Up to 225 conditions per place. [2023-08-25 05:47:42,766 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 20 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-25 05:47:42,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 112 flow [2023-08-25 05:47:42,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 05:47:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 05:47:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-25 05:47:42,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45434543454345433 [2023-08-25 05:47:42,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-25 05:47:42,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-25 05:47:42,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 05:47:42,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-25 05:47:42,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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-25 05:47:42,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 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-25 05:47:42,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 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-25 05:47:42,781 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 74 flow. Second operand 3 states and 413 transitions. [2023-08-25 05:47:42,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 33 transitions, 112 flow [2023-08-25 05:47:42,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 05:47:42,783 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 72 flow [2023-08-25 05:47:42,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2023-08-25 05:47:42,784 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -16 predicate places. [2023-08-25 05:47:42,784 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 72 flow [2023-08-25 05:47:42,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-25 05:47:42,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 05:47:42,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 05:47:42,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 05:47:42,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-08-25 05:47:42,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 05:47:42,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1524230908, now seen corresponding path program 1 times [2023-08-25 05:47:42,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 05:47:42,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088121315] [2023-08-25 05:47:42,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 05:47:42,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 05:47:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 05:47:43,303 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-25 05:47:43,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 05:47:43,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088121315] [2023-08-25 05:47:43,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088121315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 05:47:43,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 05:47:43,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 05:47:43,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027084424] [2023-08-25 05:47:43,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 05:47:43,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 05:47:43,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 05:47:43,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 05:47:43,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 05:47:43,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 303 [2023-08-25 05:47:43,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 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-25 05:47:43,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 05:47:43,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 303 [2023-08-25 05:47:43,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 05:47:43,513 INFO L124 PetriNetUnfolderBase]: 260/422 cut-off events. [2023-08-25 05:47:43,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 05:47:43,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 422 events. 260/422 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1779 event pairs, 11 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 820. Up to 177 conditions per place. [2023-08-25 05:47:43,517 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 46 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2023-08-25 05:47:43,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 218 flow [2023-08-25 05:47:43,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 05:47:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 05:47:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2023-08-25 05:47:43,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4174917491749175 [2023-08-25 05:47:43,520 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 759 transitions. [2023-08-25 05:47:43,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 759 transitions. [2023-08-25 05:47:43,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 05:47:43,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 759 transitions. [2023-08-25 05:47:43,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 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-25 05:47:43,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 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-25 05:47:43,530 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 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-25 05:47:43,530 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 72 flow. Second operand 6 states and 759 transitions. [2023-08-25 05:47:43,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 218 flow [2023-08-25 05:47:43,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 05:47:43,532 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 77 flow [2023-08-25 05:47:43,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-25 05:47:43,533 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -13 predicate places. [2023-08-25 05:47:43,533 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 77 flow [2023-08-25 05:47:43,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 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-25 05:47:43,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 05:47:43,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 05:47:43,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 05:47:43,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-08-25 05:47:43,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 05:47:43,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2069843418, now seen corresponding path program 1 times [2023-08-25 05:47:43,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 05:47:43,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421620091] [2023-08-25 05:47:43,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 05:47:43,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 05:47:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 05:47:43,873 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-25 05:47:43,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 05:47:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421620091] [2023-08-25 05:47:43,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421620091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 05:47:43,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 05:47:43,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 05:47:43,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581226328] [2023-08-25 05:47:43,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 05:47:43,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 05:47:43,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 05:47:43,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 05:47:43,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 05:47:43,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 303 [2023-08-25 05:47:43,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 77 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 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-25 05:47:43,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 05:47:43,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 303 [2023-08-25 05:47:43,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 05:47:44,006 INFO L124 PetriNetUnfolderBase]: 255/449 cut-off events. [2023-08-25 05:47:44,006 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-08-25 05:47:44,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 449 events. 255/449 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2038 event pairs, 131 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 899. Up to 337 conditions per place. [2023-08-25 05:47:44,009 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 33 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2023-08-25 05:47:44,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 173 flow [2023-08-25 05:47:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 05:47:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 05:47:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2023-08-25 05:47:44,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41034103410341033 [2023-08-25 05:47:44,012 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 746 transitions. [2023-08-25 05:47:44,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 746 transitions. [2023-08-25 05:47:44,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 05:47:44,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 746 transitions. [2023-08-25 05:47:44,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 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-25 05:47:44,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 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-25 05:47:44,018 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 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-25 05:47:44,018 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 77 flow. Second operand 6 states and 746 transitions. [2023-08-25 05:47:44,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 173 flow [2023-08-25 05:47:44,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 05:47:44,020 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 76 flow [2023-08-25 05:47:44,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-08-25 05:47:44,021 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -13 predicate places. [2023-08-25 05:47:44,021 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 76 flow [2023-08-25 05:47:44,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 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-25 05:47:44,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 05:47:44,022 INFO L208 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] [2023-08-25 05:47:44,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 05:47:44,022 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-08-25 05:47:44,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 05:47:44,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1784695208, now seen corresponding path program 1 times [2023-08-25 05:47:44,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 05:47:44,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114503426] [2023-08-25 05:47:44,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 05:47:44,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 05:47:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 05:47:44,187 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-25 05:47:44,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 05:47:44,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114503426] [2023-08-25 05:47:44,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114503426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 05:47:44,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 05:47:44,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 05:47:44,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023427822] [2023-08-25 05:47:44,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 05:47:44,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 05:47:44,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 05:47:44,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 05:47:44,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 05:47:44,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 303 [2023-08-25 05:47:44,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 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-25 05:47:44,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 05:47:44,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 303 [2023-08-25 05:47:44,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 05:47:44,317 INFO L124 PetriNetUnfolderBase]: 115/303 cut-off events. [2023-08-25 05:47:44,317 INFO L125 PetriNetUnfolderBase]: For 10/21 co-relation queries the response was YES. [2023-08-25 05:47:44,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 303 events. 115/303 cut-off events. For 10/21 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1469 event pairs, 24 based on Foata normal form. 4/292 useless extension candidates. Maximal degree in co-relation 540. Up to 136 conditions per place. [2023-08-25 05:47:44,319 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 25 selfloop transitions, 5 changer transitions 1/45 dead transitions. [2023-08-25 05:47:44,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 171 flow [2023-08-25 05:47:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 05:47:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 05:47:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2023-08-25 05:47:44,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.429042904290429 [2023-08-25 05:47:44,321 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2023-08-25 05:47:44,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2023-08-25 05:47:44,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 05:47:44,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2023-08-25 05:47:44,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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-25 05:47:44,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 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-25 05:47:44,326 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 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-25 05:47:44,326 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 76 flow. Second operand 4 states and 520 transitions. [2023-08-25 05:47:44,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 171 flow [2023-08-25 05:47:44,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 162 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 05:47:44,327 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 104 flow [2023-08-25 05:47:44,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-08-25 05:47:44,328 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -12 predicate places. [2023-08-25 05:47:44,328 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 104 flow [2023-08-25 05:47:44,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 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-25 05:47:44,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 05:47:44,329 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 05:47:44,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 05:47:44,329 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-08-25 05:47:44,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 05:47:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1421789006, now seen corresponding path program 1 times [2023-08-25 05:47:44,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 05:47:44,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482172794] [2023-08-25 05:47:44,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 05:47:44,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 05:47:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 05:47:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 05:47:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 05:47:44,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482172794] [2023-08-25 05:47:44,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482172794] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 05:47:44,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 05:47:44,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 05:47:44,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766042151] [2023-08-25 05:47:44,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 05:47:44,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 05:47:44,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 05:47:44,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 05:47:44,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 05:47:44,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 303 [2023-08-25 05:47:44,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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-25 05:47:44,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 05:47:44,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 303 [2023-08-25 05:47:44,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 05:47:44,535 INFO L124 PetriNetUnfolderBase]: 178/532 cut-off events. [2023-08-25 05:47:44,535 INFO L125 PetriNetUnfolderBase]: For 45/55 co-relation queries the response was YES. [2023-08-25 05:47:44,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 532 events. 178/532 cut-off events. For 45/55 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3110 event pairs, 93 based on Foata normal form. 14/521 useless extension candidates. Maximal degree in co-relation 991. Up to 207 conditions per place. [2023-08-25 05:47:44,538 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 38 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-08-25 05:47:44,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 249 flow [2023-08-25 05:47:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 05:47:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 05:47:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2023-08-25 05:47:44,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39933993399339934 [2023-08-25 05:47:44,540 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2023-08-25 05:47:44,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2023-08-25 05:47:44,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 05:47:44,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2023-08-25 05:47:44,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 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-25 05:47:44,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 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-25 05:47:44,545 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 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-25 05:47:44,545 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 104 flow. Second operand 5 states and 605 transitions. [2023-08-25 05:47:44,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 249 flow [2023-08-25 05:47:44,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 242 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-25 05:47:44,547 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 124 flow [2023-08-25 05:47:44,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-25 05:47:44,548 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-08-25 05:47:44,548 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 124 flow [2023-08-25 05:47:44,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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-25 05:47:44,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 05:47:44,549 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 05:47:44,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 05:47:44,549 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-08-25 05:47:44,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 05:47:44,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1735864779, now seen corresponding path program 1 times [2023-08-25 05:47:44,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 05:47:44,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274244171] [2023-08-25 05:47:44,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 05:47:44,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 05:47:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 05:47:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 05:47:44,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 05:47:44,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274244171] [2023-08-25 05:47:44,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274244171] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 05:47:44,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 05:47:44,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 05:47:44,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662457605] [2023-08-25 05:47:44,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 05:47:44,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 05:47:44,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 05:47:44,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 05:47:44,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 05:47:44,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 303 [2023-08-25 05:47:44,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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-25 05:47:44,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 05:47:44,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 303 [2023-08-25 05:47:44,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 05:47:44,751 INFO L124 PetriNetUnfolderBase]: 132/396 cut-off events. [2023-08-25 05:47:44,751 INFO L125 PetriNetUnfolderBase]: For 112/132 co-relation queries the response was YES. [2023-08-25 05:47:44,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 396 events. 132/396 cut-off events. For 112/132 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2213 event pairs, 85 based on Foata normal form. 14/400 useless extension candidates. Maximal degree in co-relation 797. Up to 205 conditions per place. [2023-08-25 05:47:44,753 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 19 selfloop transitions, 2 changer transitions 16/50 dead transitions. [2023-08-25 05:47:44,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 231 flow [2023-08-25 05:47:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 05:47:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 05:47:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-08-25 05:47:44,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39603960396039606 [2023-08-25 05:47:44,755 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-08-25 05:47:44,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-08-25 05:47:44,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 05:47:44,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-08-25 05:47:44,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 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-25 05:47:44,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 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-25 05:47:44,760 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 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-25 05:47:44,760 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 124 flow. Second operand 5 states and 600 transitions. [2023-08-25 05:47:44,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 231 flow [2023-08-25 05:47:44,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 05:47:44,762 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 109 flow [2023-08-25 05:47:44,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-25 05:47:44,763 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-25 05:47:44,763 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 109 flow [2023-08-25 05:47:44,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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-25 05:47:44,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 05:47:44,764 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 05:47:44,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 05:47:44,764 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-08-25 05:47:44,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 05:47:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash 680225350, now seen corresponding path program 1 times [2023-08-25 05:47:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 05:47:44,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754310313] [2023-08-25 05:47:44,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 05:47:44,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 05:47:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 05:47:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 05:47:44,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 05:47:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754310313] [2023-08-25 05:47:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754310313] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 05:47:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133426527] [2023-08-25 05:47:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 05:47:44,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 05:47:44,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 05:47:44,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 05:47:44,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 05:47:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 05:47:45,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-25 05:47:45,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 05:47:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 05:47:45,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 05:47:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 05:47:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133426527] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 05:47:45,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 05:47:45,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-08-25 05:47:45,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184510921] [2023-08-25 05:47:45,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 05:47:45,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 05:47:45,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 05:47:45,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 05:47:45,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-25 05:47:45,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 303 [2023-08-25 05:47:45,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 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-25 05:47:45,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 05:47:45,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 303 [2023-08-25 05:47:45,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 05:47:45,207 INFO L124 PetriNetUnfolderBase]: 117/319 cut-off events. [2023-08-25 05:47:45,207 INFO L125 PetriNetUnfolderBase]: For 139/142 co-relation queries the response was YES. [2023-08-25 05:47:45,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 319 events. 117/319 cut-off events. For 139/142 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1547 event pairs, 40 based on Foata normal form. 16/319 useless extension candidates. Maximal degree in co-relation 698. Up to 112 conditions per place. [2023-08-25 05:47:45,209 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 23 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2023-08-25 05:47:45,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 194 flow [2023-08-25 05:47:45,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 05:47:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 05:47:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2023-08-25 05:47:45,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39075907590759074 [2023-08-25 05:47:45,212 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2023-08-25 05:47:45,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2023-08-25 05:47:45,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 05:47:45,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2023-08-25 05:47:45,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 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-25 05:47:45,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 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-25 05:47:45,216 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 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-25 05:47:45,216 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 109 flow. Second operand 5 states and 592 transitions. [2023-08-25 05:47:45,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 194 flow [2023-08-25 05:47:45,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 170 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-08-25 05:47:45,218 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 118 flow [2023-08-25 05:47:45,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-25 05:47:45,219 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-08-25 05:47:45,219 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 118 flow [2023-08-25 05:47:45,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 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-25 05:47:45,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 05:47:45,220 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 05:47:45,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-25 05:47:45,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 05:47:45,426 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-08-25 05:47:45,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 05:47:45,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1912219609, now seen corresponding path program 1 times [2023-08-25 05:47:45,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 05:47:45,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574518056] [2023-08-25 05:47:45,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 05:47:45,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 05:47:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 05:47:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 05:47:45,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 05:47:45,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574518056] [2023-08-25 05:47:45,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574518056] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 05:47:45,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138407003] [2023-08-25 05:47:45,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 05:47:45,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 05:47:45,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 05:47:45,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 05:47:45,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 05:47:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 05:47:45,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-25 05:47:45,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 05:47:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 05:47:45,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 05:47:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 05:47:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138407003] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 05:47:45,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 05:47:45,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-08-25 05:47:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669789804] [2023-08-25 05:47:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 05:47:45,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 05:47:45,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 05:47:45,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 05:47:45,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-25 05:47:45,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 303 [2023-08-25 05:47:45,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 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-25 05:47:45,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 05:47:45,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 303 [2023-08-25 05:47:45,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 05:47:45,801 INFO L124 PetriNetUnfolderBase]: 94/250 cut-off events. [2023-08-25 05:47:45,801 INFO L125 PetriNetUnfolderBase]: For 128/139 co-relation queries the response was YES. [2023-08-25 05:47:45,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 250 events. 94/250 cut-off events. For 128/139 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 965 event pairs, 32 based on Foata normal form. 23/260 useless extension candidates. Maximal degree in co-relation 567. Up to 93 conditions per place. [2023-08-25 05:47:45,803 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 25 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2023-08-25 05:47:45,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 219 flow [2023-08-25 05:47:45,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 05:47:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 05:47:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2023-08-25 05:47:45,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39075907590759074 [2023-08-25 05:47:45,805 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2023-08-25 05:47:45,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2023-08-25 05:47:45,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 05:47:45,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2023-08-25 05:47:45,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 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-25 05:47:45,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 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-25 05:47:45,810 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 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-25 05:47:45,810 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 118 flow. Second operand 5 states and 592 transitions. [2023-08-25 05:47:45,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 219 flow [2023-08-25 05:47:45,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 209 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-25 05:47:45,812 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 138 flow [2023-08-25 05:47:45,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2023-08-25 05:47:45,812 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2023-08-25 05:47:45,813 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 138 flow [2023-08-25 05:47:45,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 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-25 05:47:45,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 05:47:45,813 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 05:47:45,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-25 05:47:46,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-08-25 05:47:46,019 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-08-25 05:47:46,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 05:47:46,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1442402987, now seen corresponding path program 1 times [2023-08-25 05:47:46,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 05:47:46,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431736454] [2023-08-25 05:47:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 05:47:46,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 05:47:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 05:47:46,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 05:47:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 05:47:46,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 05:47:46,178 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 05:47:46,179 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONASSERT (29 of 30 remaining) [2023-08-25 05:47:46,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 30 remaining) [2023-08-25 05:47:46,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 30 remaining) [2023-08-25 05:47:46,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 30 remaining) [2023-08-25 05:47:46,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 30 remaining) [2023-08-25 05:47:46,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 30 remaining) [2023-08-25 05:47:46,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 30 remaining) [2023-08-25 05:47:46,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 30 remaining) [2023-08-25 05:47:46,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 30 remaining) [2023-08-25 05:47:46,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 30 remaining) [2023-08-25 05:47:46,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 30 remaining) [2023-08-25 05:47:46,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 30 remaining) [2023-08-25 05:47:46,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 30 remaining) [2023-08-25 05:47:46,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 30 remaining) [2023-08-25 05:47:46,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 30 remaining) [2023-08-25 05:47:46,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 30 remaining) [2023-08-25 05:47:46,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 30 remaining) [2023-08-25 05:47:46,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (12 of 30 remaining) [2023-08-25 05:47:46,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 30 remaining) [2023-08-25 05:47:46,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 30 remaining) [2023-08-25 05:47:46,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONDATA_RACE (9 of 30 remaining) [2023-08-25 05:47:46,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONDATA_RACE (8 of 30 remaining) [2023-08-25 05:47:46,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONDATA_RACE (7 of 30 remaining) [2023-08-25 05:47:46,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONDATA_RACE (6 of 30 remaining) [2023-08-25 05:47:46,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONDATA_RACE (5 of 30 remaining) [2023-08-25 05:47:46,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 30 remaining) [2023-08-25 05:47:46,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (3 of 30 remaining) [2023-08-25 05:47:46,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 30 remaining) [2023-08-25 05:47:46,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONDATA_RACE (1 of 30 remaining) [2023-08-25 05:47:46,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONDATA_RACE (0 of 30 remaining) [2023-08-25 05:47:46,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 05:47:46,185 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 05:47:46,189 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 05:47:46,189 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 05:47:46,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 05:47:46 BasicIcfg [2023-08-25 05:47:46,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 05:47:46,236 INFO L158 Benchmark]: Toolchain (without parser) took 9451.89ms. Allocated memory was 394.3MB in the beginning and 549.5MB in the end (delta: 155.2MB). Free memory was 353.4MB in the beginning and 492.4MB in the end (delta: -138.9MB). Peak memory consumption was 16.3MB. Max. memory is 16.0GB. [2023-08-25 05:47:46,236 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 394.3MB. Free memory is still 372.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 05:47:46,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.85ms. Allocated memory is still 394.3MB. Free memory was 352.4MB in the beginning and 340.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-25 05:47:46,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.94ms. Allocated memory is still 394.3MB. Free memory was 340.8MB in the beginning and 338.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 05:47:46,237 INFO L158 Benchmark]: Boogie Preprocessor took 29.50ms. Allocated memory is still 394.3MB. Free memory was 338.8MB in the beginning and 336.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 05:47:46,237 INFO L158 Benchmark]: RCFGBuilder took 702.14ms. Allocated memory is still 394.3MB. Free memory was 336.7MB in the beginning and 296.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-25 05:47:46,238 INFO L158 Benchmark]: TraceAbstraction took 8438.47ms. Allocated memory was 394.3MB in the beginning and 549.5MB in the end (delta: 155.2MB). Free memory was 295.8MB in the beginning and 492.4MB in the end (delta: -196.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 05:47:46,239 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 394.3MB. Free memory is still 372.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 231.85ms. Allocated memory is still 394.3MB. Free memory was 352.4MB in the beginning and 340.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.94ms. Allocated memory is still 394.3MB. Free memory was 340.8MB in the beginning and 338.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.50ms. Allocated memory is still 394.3MB. Free memory was 338.8MB in the beginning and 336.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 702.14ms. Allocated memory is still 394.3MB. Free memory was 336.7MB in the beginning and 296.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 8438.47ms. Allocated memory was 394.3MB in the beginning and 549.5MB in the end (delta: 155.2MB). Free memory was 295.8MB in the beginning and 492.4MB in the end (delta: -196.6MB). There was no memory consumed. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 152 PlacesBefore, 52 PlacesAfterwards, 154 TransitionsBefore, 50 TransitionsAfterwards, 1976 CoEnabledTransitionPairs, 7 FixpointIterations, 87 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 6 ConcurrentYvCompositions, 4 ChoiceCompositions, 138 TotalNumberOfCompositions, 11180 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5968, independent: 5525, independent conditional: 0, independent unconditional: 5525, dependent: 443, dependent conditional: 0, dependent unconditional: 443, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1094, independent: 1041, independent conditional: 0, independent unconditional: 1041, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5968, independent: 4484, independent conditional: 0, independent unconditional: 4484, dependent: 390, dependent conditional: 0, dependent unconditional: 390, unknown: 1094, unknown conditional: 0, unknown unconditional: 1094] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 280, Positive conditional cache size: 0, Positive unconditional cache size: 280, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 21]: assertion can be violated assertion can be violated We found a FailurePath: [L41] 0 int* A; [L42] 0 int counter, N; [L75] 0 pthread_t t1, t2; [L77] 0 N = __VERIFIER_nondet_int() [L78] EXPR 0 create_fresh_int_array(N) [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L97] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={5:0}, counter=0, i=0, size=1] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={5:0}, counter=0, i=1, size=1] [L97] COND FALSE 0 !(i < size) [L100] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={5:0}, N=1, counter=0, pthread_create(&t1, 0, thread1, 0)=-2, t1={8:0}, t2={7:0}] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={5:0}, N=1, counter=0, pthread_create(&t2, 0, thread2, 0)=-1, t1={8:0}, t2={7:0}] [L62] 2 int i=0; VAL [A={5:0}, N=1, counter=0, i=0] [L62] 2 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp [L49] 1 i++ VAL [A={5:0}, N=1, counter=-3, i=1, tmp=-3] [L49] 1 i