/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 21:40:04,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 21:40:04,313 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 21:40:04,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 21:40:04,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 21:40:04,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 21:40:04,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 21:40:04,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 21:40:04,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 21:40:04,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 21:40:04,360 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 21:40:04,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 21:40:04,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 21:40:04,362 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 21:40:04,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 21:40:04,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 21:40:04,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 21:40:04,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 21:40:04,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 21:40:04,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 21:40:04,363 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 21:40:04,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 21:40:04,364 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 21:40:04,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 21:40:04,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 21:40:04,365 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 21:40:04,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 21:40:04,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:40:04,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 21:40:04,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 21:40:04,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 21:40:04,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 21:40:04,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 21:40:04,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 21:40:04,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 21:40:04,368 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 21:40:04,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 21:40:04,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 21:40:04,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 21:40:04,701 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 21:40:04,702 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 21:40:04,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2023-08-25 21:40:05,868 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 21:40:06,163 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 21:40:06,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2023-08-25 21:40:06,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53067a26/66f0f40027c04180a520fe42faf93b80/FLAG5720f10cb [2023-08-25 21:40:06,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53067a26/66f0f40027c04180a520fe42faf93b80 [2023-08-25 21:40:06,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 21:40:06,195 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 21:40:06,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 21:40:06,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 21:40:06,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 21:40:06,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:40:06" (1/1) ... [2023-08-25 21:40:06,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb651e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06, skipping insertion in model container [2023-08-25 21:40:06,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:40:06" (1/1) ... [2023-08-25 21:40:06,248 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 21:40:06,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:40:06,665 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 21:40:06,691 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [218] [2023-08-25 21:40:06,693 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [219] [2023-08-25 21:40:06,699 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [730] [2023-08-25 21:40:06,708 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned long [871] [2023-08-25 21:40:06,726 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:40:06,789 INFO L206 MainTranslator]: Completed translation [2023-08-25 21:40:06,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06 WrapperNode [2023-08-25 21:40:06,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 21:40:06,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 21:40:06,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 21:40:06,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 21:40:06,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06" (1/1) ... [2023-08-25 21:40:06,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06" (1/1) ... [2023-08-25 21:40:06,869 INFO L138 Inliner]: procedures = 243, calls = 51, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 106 [2023-08-25 21:40:06,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 21:40:06,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 21:40:06,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 21:40:06,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 21:40:06,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06" (1/1) ... [2023-08-25 21:40:06,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06" (1/1) ... [2023-08-25 21:40:06,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06" (1/1) ... [2023-08-25 21:40:06,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06" (1/1) ... [2023-08-25 21:40:06,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06" (1/1) ... [2023-08-25 21:40:06,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06" (1/1) ... [2023-08-25 21:40:06,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06" (1/1) ... [2023-08-25 21:40:06,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06" (1/1) ... [2023-08-25 21:40:06,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 21:40:06,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 21:40:06,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 21:40:06,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 21:40:06,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06" (1/1) ... [2023-08-25 21:40:06,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:40:06,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:40:06,962 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 21:40:06,984 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 21:40:07,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 21:40:07,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 21:40:07,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-08-25 21:40:07,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 21:40:07,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 21:40:07,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 21:40:07,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 21:40:07,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 21:40:07,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 21:40:07,004 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-25 21:40:07,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 21:40:07,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 21:40:07,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 21:40:07,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 21:40:07,006 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 21:40:07,174 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 21:40:07,175 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 21:40:07,404 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 21:40:07,412 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 21:40:07,413 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-25 21:40:07,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:40:07 BoogieIcfgContainer [2023-08-25 21:40:07,415 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 21:40:07,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 21:40:07,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 21:40:07,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 21:40:07,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 09:40:06" (1/3) ... [2023-08-25 21:40:07,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722964b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:40:07, skipping insertion in model container [2023-08-25 21:40:07,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:40:06" (2/3) ... [2023-08-25 21:40:07,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722964b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:40:07, skipping insertion in model container [2023-08-25 21:40:07,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:40:07" (3/3) ... [2023-08-25 21:40:07,421 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2023-08-25 21:40:07,436 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 21:40:07,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-25 21:40:07,436 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 21:40:07,536 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-25 21:40:07,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 206 transitions, 428 flow [2023-08-25 21:40:07,675 INFO L124 PetriNetUnfolderBase]: 11/204 cut-off events. [2023-08-25 21:40:07,675 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 21:40:07,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 204 events. 11/204 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 359 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 111. Up to 3 conditions per place. [2023-08-25 21:40:07,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 206 transitions, 428 flow [2023-08-25 21:40:07,692 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 191 transitions, 394 flow [2023-08-25 21:40:07,697 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 21:40:07,718 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 191 transitions, 394 flow [2023-08-25 21:40:07,720 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 191 transitions, 394 flow [2023-08-25 21:40:07,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 191 transitions, 394 flow [2023-08-25 21:40:07,774 INFO L124 PetriNetUnfolderBase]: 8/191 cut-off events. [2023-08-25 21:40:07,774 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 21:40:07,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 191 events. 8/191 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 335 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-08-25 21:40:07,780 INFO L119 LiptonReduction]: Number of co-enabled transitions 7052 [2023-08-25 21:40:13,518 INFO L134 LiptonReduction]: Checked pairs total: 19909 [2023-08-25 21:40:13,519 INFO L136 LiptonReduction]: Total number of compositions: 158 [2023-08-25 21:40:13,530 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 21:40:13,535 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;@47950589, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 21:40:13,535 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-08-25 21:40:13,536 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 21:40:13,537 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 21:40:13,537 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 21:40:13,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:13,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 21:40:13,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:13,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:13,542 INFO L85 PathProgramCache]: Analyzing trace with hash 744, now seen corresponding path program 1 times [2023-08-25 21:40:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:13,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117734389] [2023-08-25 21:40:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:13,647 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 21:40:13,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:13,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117734389] [2023-08-25 21:40:13,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117734389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:40:13,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:40:13,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 21:40:13,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594261043] [2023-08-25 21:40:13,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:40:13,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 21:40:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:13,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 21:40:13,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 21:40:13,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 364 [2023-08-25 21:40:13,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 195.5) internal successors, (391), 2 states have internal predecessors, (391), 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 21:40:13,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:13,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 364 [2023-08-25 21:40:13,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:13,781 INFO L124 PetriNetUnfolderBase]: 205/510 cut-off events. [2023-08-25 21:40:13,781 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-25 21:40:13,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 510 events. 205/510 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2576 event pairs, 141 based on Foata normal form. 32/453 useless extension candidates. Maximal degree in co-relation 768. Up to 333 conditions per place. [2023-08-25 21:40:13,786 INFO L140 encePairwiseOnDemand]: 352/364 looper letters, 25 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2023-08-25 21:40:13,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 158 flow [2023-08-25 21:40:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 21:40:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 21:40:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 427 transitions. [2023-08-25 21:40:13,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5865384615384616 [2023-08-25 21:40:13,800 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 427 transitions. [2023-08-25 21:40:13,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 427 transitions. [2023-08-25 21:40:13,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:13,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 427 transitions. [2023-08-25 21:40:13,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 213.5) internal successors, (427), 2 states have internal predecessors, (427), 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 21:40:13,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 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 21:40:13,812 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 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 21:40:13,813 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 132 flow. Second operand 2 states and 427 transitions. [2023-08-25 21:40:13,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 158 flow [2023-08-25 21:40:13,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 150 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 21:40:13,818 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 100 flow [2023-08-25 21:40:13,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2023-08-25 21:40:13,823 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -13 predicate places. [2023-08-25 21:40:13,823 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 100 flow [2023-08-25 21:40:13,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 195.5) internal successors, (391), 2 states have internal predecessors, (391), 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 21:40:13,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:13,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 21:40:13,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 21:40:13,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:13,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:13,825 INFO L85 PathProgramCache]: Analyzing trace with hash 385503927, now seen corresponding path program 1 times [2023-08-25 21:40:13,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:13,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208739801] [2023-08-25 21:40:13,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:13,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:13,963 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 21:40:13,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:13,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208739801] [2023-08-25 21:40:13,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208739801] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:40:13,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:40:13,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:40:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879600467] [2023-08-25 21:40:13,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:40:13,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:40:13,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:13,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:40:13,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:40:13,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 364 [2023-08-25 21:40:13,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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 21:40:13,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:13,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 364 [2023-08-25 21:40:13,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:14,208 INFO L124 PetriNetUnfolderBase]: 962/1805 cut-off events. [2023-08-25 21:40:14,209 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-25 21:40:14,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3427 conditions, 1805 events. 962/1805 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9335 event pairs, 326 based on Foata normal form. 0/1553 useless extension candidates. Maximal degree in co-relation 3424. Up to 870 conditions per place. [2023-08-25 21:40:14,220 INFO L140 encePairwiseOnDemand]: 350/364 looper letters, 62 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2023-08-25 21:40:14,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 80 transitions, 310 flow [2023-08-25 21:40:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:40:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:40:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 598 transitions. [2023-08-25 21:40:14,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2023-08-25 21:40:14,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 598 transitions. [2023-08-25 21:40:14,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 598 transitions. [2023-08-25 21:40:14,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:14,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 598 transitions. [2023-08-25 21:40:14,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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 21:40:14,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:14,235 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:14,235 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 100 flow. Second operand 3 states and 598 transitions. [2023-08-25 21:40:14,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 80 transitions, 310 flow [2023-08-25 21:40:14,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 310 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:40:14,238 INFO L231 Difference]: Finished difference. Result has 52 places, 58 transitions, 188 flow [2023-08-25 21:40:14,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=52, PETRI_TRANSITIONS=58} [2023-08-25 21:40:14,240 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2023-08-25 21:40:14,240 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 58 transitions, 188 flow [2023-08-25 21:40:14,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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 21:40:14,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:14,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:40:14,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 21:40:14,245 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:14,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash -393775609, now seen corresponding path program 1 times [2023-08-25 21:40:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906652445] [2023-08-25 21:40:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:14,393 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 21:40:14,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:14,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906652445] [2023-08-25 21:40:14,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906652445] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:40:14,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:40:14,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:40:14,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825259804] [2023-08-25 21:40:14,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:40:14,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:40:14,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:14,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:40:14,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:40:14,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 364 [2023-08-25 21:40:14,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 58 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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 21:40:14,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:14,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 364 [2023-08-25 21:40:14,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:14,661 INFO L124 PetriNetUnfolderBase]: 888/1905 cut-off events. [2023-08-25 21:40:14,661 INFO L125 PetriNetUnfolderBase]: For 174/178 co-relation queries the response was YES. [2023-08-25 21:40:14,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3908 conditions, 1905 events. 888/1905 cut-off events. For 174/178 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10785 event pairs, 322 based on Foata normal form. 0/1672 useless extension candidates. Maximal degree in co-relation 3903. Up to 971 conditions per place. [2023-08-25 21:40:14,673 INFO L140 encePairwiseOnDemand]: 359/364 looper letters, 48 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-08-25 21:40:14,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 333 flow [2023-08-25 21:40:14,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:40:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:40:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2023-08-25 21:40:14,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5558608058608059 [2023-08-25 21:40:14,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 607 transitions. [2023-08-25 21:40:14,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 607 transitions. [2023-08-25 21:40:14,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:14,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 607 transitions. [2023-08-25 21:40:14,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 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 21:40:14,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:14,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:14,681 INFO L175 Difference]: Start difference. First operand has 52 places, 58 transitions, 188 flow. Second operand 3 states and 607 transitions. [2023-08-25 21:40:14,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 333 flow [2023-08-25 21:40:14,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 78 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 21:40:14,689 INFO L231 Difference]: Finished difference. Result has 54 places, 60 transitions, 192 flow [2023-08-25 21:40:14,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=54, PETRI_TRANSITIONS=60} [2023-08-25 21:40:14,691 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -7 predicate places. [2023-08-25 21:40:14,693 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 60 transitions, 192 flow [2023-08-25 21:40:14,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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 21:40:14,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:14,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:40:14,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 21:40:14,695 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:14,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:14,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1026766716, now seen corresponding path program 1 times [2023-08-25 21:40:14,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:14,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227923876] [2023-08-25 21:40:14,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:14,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:14,794 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 21:40:14,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:14,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227923876] [2023-08-25 21:40:14,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227923876] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:40:14,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:40:14,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 21:40:14,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260363797] [2023-08-25 21:40:14,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:40:14,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:40:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:14,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:40:14,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:40:14,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 364 [2023-08-25 21:40:14,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 60 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 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 21:40:14,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:14,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 364 [2023-08-25 21:40:14,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:15,006 INFO L124 PetriNetUnfolderBase]: 752/1867 cut-off events. [2023-08-25 21:40:15,007 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2023-08-25 21:40:15,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3714 conditions, 1867 events. 752/1867 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 12253 event pairs, 303 based on Foata normal form. 0/1711 useless extension candidates. Maximal degree in co-relation 3708. Up to 783 conditions per place. [2023-08-25 21:40:15,019 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 42 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2023-08-25 21:40:15,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 325 flow [2023-08-25 21:40:15,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:40:15,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:40:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2023-08-25 21:40:15,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2023-08-25 21:40:15,022 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 609 transitions. [2023-08-25 21:40:15,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 609 transitions. [2023-08-25 21:40:15,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:15,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 609 transitions. [2023-08-25 21:40:15,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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 21:40:15,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:15,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:15,026 INFO L175 Difference]: Start difference. First operand has 54 places, 60 transitions, 192 flow. Second operand 3 states and 609 transitions. [2023-08-25 21:40:15,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 325 flow [2023-08-25 21:40:15,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 21:40:15,030 INFO L231 Difference]: Finished difference. Result has 55 places, 61 transitions, 198 flow [2023-08-25 21:40:15,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=55, PETRI_TRANSITIONS=61} [2023-08-25 21:40:15,032 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2023-08-25 21:40:15,033 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 61 transitions, 198 flow [2023-08-25 21:40:15,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 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 21:40:15,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:15,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:40:15,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 21:40:15,034 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:15,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash -91251144, now seen corresponding path program 1 times [2023-08-25 21:40:15,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:15,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932387991] [2023-08-25 21:40:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:15,091 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 21:40:15,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:15,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932387991] [2023-08-25 21:40:15,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932387991] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:40:15,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:40:15,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:40:15,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354577164] [2023-08-25 21:40:15,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:40:15,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:40:15,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:15,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:40:15,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:40:15,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 364 [2023-08-25 21:40:15,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 61 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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 21:40:15,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:15,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 364 [2023-08-25 21:40:15,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:15,379 INFO L124 PetriNetUnfolderBase]: 1683/3125 cut-off events. [2023-08-25 21:40:15,379 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2023-08-25 21:40:15,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7445 conditions, 3125 events. 1683/3125 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 17460 event pairs, 901 based on Foata normal form. 0/2850 useless extension candidates. Maximal degree in co-relation 7438. Up to 2265 conditions per place. [2023-08-25 21:40:15,398 INFO L140 encePairwiseOnDemand]: 357/364 looper letters, 68 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2023-08-25 21:40:15,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 442 flow [2023-08-25 21:40:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:40:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:40:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 578 transitions. [2023-08-25 21:40:15,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5293040293040293 [2023-08-25 21:40:15,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 578 transitions. [2023-08-25 21:40:15,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 578 transitions. [2023-08-25 21:40:15,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:15,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 578 transitions. [2023-08-25 21:40:15,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 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 21:40:15,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:15,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:15,406 INFO L175 Difference]: Start difference. First operand has 55 places, 61 transitions, 198 flow. Second operand 3 states and 578 transitions. [2023-08-25 21:40:15,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 442 flow [2023-08-25 21:40:15,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 88 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:40:15,410 INFO L231 Difference]: Finished difference. Result has 58 places, 70 transitions, 294 flow [2023-08-25 21:40:15,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=58, PETRI_TRANSITIONS=70} [2023-08-25 21:40:15,413 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2023-08-25 21:40:15,413 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 70 transitions, 294 flow [2023-08-25 21:40:15,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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 21:40:15,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:15,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:40:15,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 21:40:15,414 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:15,414 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:15,414 INFO L85 PathProgramCache]: Analyzing trace with hash -477415254, now seen corresponding path program 1 times [2023-08-25 21:40:15,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:15,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270475430] [2023-08-25 21:40:15,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:15,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:15,551 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 21:40:15,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:15,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270475430] [2023-08-25 21:40:15,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270475430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:40:15,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:40:15,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 21:40:15,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042335793] [2023-08-25 21:40:15,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:40:15,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:40:15,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:15,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:40:15,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:40:15,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 364 [2023-08-25 21:40:15,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 70 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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 21:40:15,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:15,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 364 [2023-08-25 21:40:15,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:15,700 INFO L124 PetriNetUnfolderBase]: 236/693 cut-off events. [2023-08-25 21:40:15,701 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2023-08-25 21:40:15,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 693 events. 236/693 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3639 event pairs, 58 based on Foata normal form. 46/725 useless extension candidates. Maximal degree in co-relation 1570. Up to 268 conditions per place. [2023-08-25 21:40:15,704 INFO L140 encePairwiseOnDemand]: 356/364 looper letters, 29 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2023-08-25 21:40:15,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 268 flow [2023-08-25 21:40:15,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:40:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:40:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2023-08-25 21:40:15,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5228937728937729 [2023-08-25 21:40:15,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 571 transitions. [2023-08-25 21:40:15,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions. [2023-08-25 21:40:15,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:15,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions. [2023-08-25 21:40:15,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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 21:40:15,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:15,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:15,711 INFO L175 Difference]: Start difference. First operand has 58 places, 70 transitions, 294 flow. Second operand 3 states and 571 transitions. [2023-08-25 21:40:15,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 268 flow [2023-08-25 21:40:15,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 234 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-25 21:40:15,713 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 152 flow [2023-08-25 21:40:15,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-08-25 21:40:15,714 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -10 predicate places. [2023-08-25 21:40:15,714 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 152 flow [2023-08-25 21:40:15,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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 21:40:15,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:15,715 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] [2023-08-25 21:40:15,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 21:40:15,715 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:15,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1608743899, now seen corresponding path program 1 times [2023-08-25 21:40:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377828634] [2023-08-25 21:40:15,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:15,749 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 21:40:15,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:15,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377828634] [2023-08-25 21:40:15,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377828634] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:40:15,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:40:15,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:40:15,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975527010] [2023-08-25 21:40:15,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:40:15,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:40:15,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:15,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:40:15,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:40:15,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 364 [2023-08-25 21:40:15,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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 21:40:15,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:15,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 364 [2023-08-25 21:40:15,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:15,833 INFO L124 PetriNetUnfolderBase]: 211/585 cut-off events. [2023-08-25 21:40:15,834 INFO L125 PetriNetUnfolderBase]: For 116/120 co-relation queries the response was YES. [2023-08-25 21:40:15,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 585 events. 211/585 cut-off events. For 116/120 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2891 event pairs, 152 based on Foata normal form. 0/567 useless extension candidates. Maximal degree in co-relation 1258. Up to 357 conditions per place. [2023-08-25 21:40:15,837 INFO L140 encePairwiseOnDemand]: 360/364 looper letters, 28 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2023-08-25 21:40:15,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 223 flow [2023-08-25 21:40:15,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:40:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:40:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2023-08-25 21:40:15,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5137362637362637 [2023-08-25 21:40:15,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 561 transitions. [2023-08-25 21:40:15,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 561 transitions. [2023-08-25 21:40:15,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:15,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 561 transitions. [2023-08-25 21:40:15,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 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 21:40:15,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:15,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:15,844 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 152 flow. Second operand 3 states and 561 transitions. [2023-08-25 21:40:15,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 223 flow [2023-08-25 21:40:15,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:40:15,850 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 147 flow [2023-08-25 21:40:15,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2023-08-25 21:40:15,850 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -10 predicate places. [2023-08-25 21:40:15,850 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 147 flow [2023-08-25 21:40:15,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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 21:40:15,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:15,852 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 21:40:15,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 21:40:15,852 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:15,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:15,854 INFO L85 PathProgramCache]: Analyzing trace with hash 811848566, now seen corresponding path program 1 times [2023-08-25 21:40:15,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:15,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320147531] [2023-08-25 21:40:15,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:15,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:40:15,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:15,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320147531] [2023-08-25 21:40:15,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320147531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:40:15,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:40:15,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 21:40:15,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086786719] [2023-08-25 21:40:15,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:40:15,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:40:15,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:15,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:40:15,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:40:15,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 364 [2023-08-25 21:40:15,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 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 21:40:15,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:15,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 364 [2023-08-25 21:40:15,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:16,042 INFO L124 PetriNetUnfolderBase]: 283/857 cut-off events. [2023-08-25 21:40:16,042 INFO L125 PetriNetUnfolderBase]: For 174/178 co-relation queries the response was YES. [2023-08-25 21:40:16,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1739 conditions, 857 events. 283/857 cut-off events. For 174/178 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4286 event pairs, 112 based on Foata normal form. 26/876 useless extension candidates. Maximal degree in co-relation 1731. Up to 290 conditions per place. [2023-08-25 21:40:16,047 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 44 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-25 21:40:16,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 303 flow [2023-08-25 21:40:16,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:40:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:40:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2023-08-25 21:40:16,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5531135531135531 [2023-08-25 21:40:16,052 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 604 transitions. [2023-08-25 21:40:16,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 604 transitions. [2023-08-25 21:40:16,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:16,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 604 transitions. [2023-08-25 21:40:16,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 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 21:40:16,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:16,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:16,057 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 147 flow. Second operand 3 states and 604 transitions. [2023-08-25 21:40:16,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 303 flow [2023-08-25 21:40:16,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 21:40:16,061 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 154 flow [2023-08-25 21:40:16,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2023-08-25 21:40:16,064 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2023-08-25 21:40:16,064 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 154 flow [2023-08-25 21:40:16,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 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 21:40:16,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:16,065 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, 1, 1, 1] [2023-08-25 21:40:16,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 21:40:16,065 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:16,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash -964841638, now seen corresponding path program 1 times [2023-08-25 21:40:16,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:16,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553622160] [2023-08-25 21:40:16,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:16,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:16,120 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 21:40:16,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:16,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553622160] [2023-08-25 21:40:16,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553622160] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:40:16,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:40:16,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:40:16,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230621616] [2023-08-25 21:40:16,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:40:16,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:40:16,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:16,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:40:16,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:40:16,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 364 [2023-08-25 21:40:16,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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 21:40:16,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:16,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 364 [2023-08-25 21:40:16,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:16,245 INFO L124 PetriNetUnfolderBase]: 478/1077 cut-off events. [2023-08-25 21:40:16,245 INFO L125 PetriNetUnfolderBase]: For 320/324 co-relation queries the response was YES. [2023-08-25 21:40:16,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2514 conditions, 1077 events. 478/1077 cut-off events. For 320/324 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4728 event pairs, 372 based on Foata normal form. 0/1073 useless extension candidates. Maximal degree in co-relation 2505. Up to 886 conditions per place. [2023-08-25 21:40:16,250 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 40 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2023-08-25 21:40:16,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 249 flow [2023-08-25 21:40:16,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:40:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:40:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2023-08-25 21:40:16,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5082417582417582 [2023-08-25 21:40:16,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 555 transitions. [2023-08-25 21:40:16,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions. [2023-08-25 21:40:16,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:16,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions. [2023-08-25 21:40:16,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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 21:40:16,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:16,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 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 21:40:16,257 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 154 flow. Second operand 3 states and 555 transitions. [2023-08-25 21:40:16,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 249 flow [2023-08-25 21:40:16,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 247 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:40:16,259 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 156 flow [2023-08-25 21:40:16,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-08-25 21:40:16,260 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2023-08-25 21:40:16,260 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 156 flow [2023-08-25 21:40:16,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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 21:40:16,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:16,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:40:16,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 21:40:16,261 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:16,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1107163605, now seen corresponding path program 1 times [2023-08-25 21:40:16,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:16,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301744983] [2023-08-25 21:40:16,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:16,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:40:16,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:16,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301744983] [2023-08-25 21:40:16,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301744983] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:40:16,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947650940] [2023-08-25 21:40:16,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:16,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:40:16,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:40:16,357 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 21:40:16,377 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 21:40:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:16,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 21:40:16,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:40:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:40:16,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:40:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:40:16,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947650940] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:40:16,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:40:16,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-08-25 21:40:16,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470052743] [2023-08-25 21:40:16,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:40:16,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:40:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:16,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:40:16,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:40:16,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 364 [2023-08-25 21:40:16,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 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 21:40:16,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:16,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 364 [2023-08-25 21:40:16,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:16,815 INFO L124 PetriNetUnfolderBase]: 449/1416 cut-off events. [2023-08-25 21:40:16,815 INFO L125 PetriNetUnfolderBase]: For 346/354 co-relation queries the response was YES. [2023-08-25 21:40:16,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2922 conditions, 1416 events. 449/1416 cut-off events. For 346/354 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 7811 event pairs, 115 based on Foata normal form. 76/1482 useless extension candidates. Maximal degree in co-relation 2913. Up to 261 conditions per place. [2023-08-25 21:40:16,823 INFO L140 encePairwiseOnDemand]: 360/364 looper letters, 65 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2023-08-25 21:40:16,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 436 flow [2023-08-25 21:40:16,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 21:40:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 21:40:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1012 transitions. [2023-08-25 21:40:16,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5560439560439561 [2023-08-25 21:40:16,826 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1012 transitions. [2023-08-25 21:40:16,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1012 transitions. [2023-08-25 21:40:16,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:16,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1012 transitions. [2023-08-25 21:40:16,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 202.4) internal successors, (1012), 5 states have internal predecessors, (1012), 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 21:40:16,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 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 21:40:16,831 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 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 21:40:16,831 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 156 flow. Second operand 5 states and 1012 transitions. [2023-08-25 21:40:16,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 436 flow [2023-08-25 21:40:16,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 89 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 21:40:16,834 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 182 flow [2023-08-25 21:40:16,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-25 21:40:16,836 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2023-08-25 21:40:16,836 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 182 flow [2023-08-25 21:40:16,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 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 21:40:16,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:16,837 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 21:40:16,845 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 21:40:17,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-25 21:40:17,043 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:17,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:17,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1633514897, now seen corresponding path program 2 times [2023-08-25 21:40:17,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:17,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840033] [2023-08-25 21:40:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:17,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-08-25 21:40:17,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:17,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840033] [2023-08-25 21:40:17,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840033] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:40:17,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754893821] [2023-08-25 21:40:17,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 21:40:17,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:40:17,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:40:17,148 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 21:40:17,150 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 21:40:17,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-25 21:40:17,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:40:17,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-25 21:40:17,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:40:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-08-25 21:40:17,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:40:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-08-25 21:40:17,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754893821] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:40:17,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:40:17,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-08-25 21:40:17,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123074699] [2023-08-25 21:40:17,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:40:17,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 21:40:17,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:17,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 21:40:17,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-08-25 21:40:17,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 364 [2023-08-25 21:40:17,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 182 flow. Second operand has 12 states, 12 states have (on average 188.75) internal successors, (2265), 12 states have internal predecessors, (2265), 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 21:40:17,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:17,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 364 [2023-08-25 21:40:17,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:18,306 INFO L124 PetriNetUnfolderBase]: 976/3051 cut-off events. [2023-08-25 21:40:18,307 INFO L125 PetriNetUnfolderBase]: For 1353/1365 co-relation queries the response was YES. [2023-08-25 21:40:18,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6663 conditions, 3051 events. 976/3051 cut-off events. For 1353/1365 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 18839 event pairs, 64 based on Foata normal form. 43/3091 useless extension candidates. Maximal degree in co-relation 6652. Up to 385 conditions per place. [2023-08-25 21:40:18,324 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 136 selfloop transitions, 13 changer transitions 1/169 dead transitions. [2023-08-25 21:40:18,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 169 transitions, 1005 flow [2023-08-25 21:40:18,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-25 21:40:18,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-25 21:40:18,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2324 transitions. [2023-08-25 21:40:18,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532051282051282 [2023-08-25 21:40:18,330 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2324 transitions. [2023-08-25 21:40:18,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2324 transitions. [2023-08-25 21:40:18,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:18,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2324 transitions. [2023-08-25 21:40:18,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 193.66666666666666) internal successors, (2324), 12 states have internal predecessors, (2324), 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 21:40:18,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 364.0) internal successors, (4732), 13 states have internal predecessors, (4732), 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 21:40:18,342 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 364.0) internal successors, (4732), 13 states have internal predecessors, (4732), 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 21:40:18,342 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 182 flow. Second operand 12 states and 2324 transitions. [2023-08-25 21:40:18,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 169 transitions, 1005 flow [2023-08-25 21:40:18,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 169 transitions, 969 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-08-25 21:40:18,347 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 243 flow [2023-08-25 21:40:18,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=243, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2023-08-25 21:40:18,348 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2023-08-25 21:40:18,348 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 243 flow [2023-08-25 21:40:18,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 188.75) internal successors, (2265), 12 states have internal predecessors, (2265), 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 21:40:18,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:18,349 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:40:18,365 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 21:40:18,555 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,SelfDestructingSolverStorable10 [2023-08-25 21:40:18,555 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:18,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash -493676605, now seen corresponding path program 3 times [2023-08-25 21:40:18,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:18,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616509413] [2023-08-25 21:40:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:18,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-08-25 21:40:18,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:18,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616509413] [2023-08-25 21:40:18,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616509413] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:40:18,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:40:18,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 21:40:18,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318025910] [2023-08-25 21:40:18,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:40:18,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 21:40:18,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:18,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 21:40:18,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 21:40:18,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 364 [2023-08-25 21:40:18,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 190.8) internal successors, (954), 5 states have internal predecessors, (954), 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 21:40:18,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:18,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 364 [2023-08-25 21:40:18,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:19,161 INFO L124 PetriNetUnfolderBase]: 1131/3105 cut-off events. [2023-08-25 21:40:19,161 INFO L125 PetriNetUnfolderBase]: For 1783/1783 co-relation queries the response was YES. [2023-08-25 21:40:19,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7443 conditions, 3105 events. 1131/3105 cut-off events. For 1783/1783 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 18674 event pairs, 363 based on Foata normal form. 44/3039 useless extension candidates. Maximal degree in co-relation 7431. Up to 1137 conditions per place. [2023-08-25 21:40:19,176 INFO L140 encePairwiseOnDemand]: 356/364 looper letters, 76 selfloop transitions, 7 changer transitions 7/103 dead transitions. [2023-08-25 21:40:19,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 103 transitions, 595 flow [2023-08-25 21:40:19,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:40:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:40:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1174 transitions. [2023-08-25 21:40:19,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375457875457875 [2023-08-25 21:40:19,179 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1174 transitions. [2023-08-25 21:40:19,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1174 transitions. [2023-08-25 21:40:19,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:19,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1174 transitions. [2023-08-25 21:40:19,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 195.66666666666666) internal successors, (1174), 6 states have internal predecessors, (1174), 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 21:40:19,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 364.0) internal successors, (2548), 7 states have internal predecessors, (2548), 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 21:40:19,186 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 364.0) internal successors, (2548), 7 states have internal predecessors, (2548), 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 21:40:19,186 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 243 flow. Second operand 6 states and 1174 transitions. [2023-08-25 21:40:19,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 103 transitions, 595 flow [2023-08-25 21:40:19,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 103 transitions, 560 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-25 21:40:19,191 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 265 flow [2023-08-25 21:40:19,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2023-08-25 21:40:19,191 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 12 predicate places. [2023-08-25 21:40:19,191 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 265 flow [2023-08-25 21:40:19,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.8) internal successors, (954), 5 states have internal predecessors, (954), 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 21:40:19,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:19,192 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:40:19,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 21:40:19,192 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:19,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:19,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1501413387, now seen corresponding path program 4 times [2023-08-25 21:40:19,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:19,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299199110] [2023-08-25 21:40:19,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:19,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-08-25 21:40:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299199110] [2023-08-25 21:40:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299199110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:40:19,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:40:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:40:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576532388] [2023-08-25 21:40:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:40:19,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:40:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:40:19,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:40:19,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 364 [2023-08-25 21:40:19,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 265 flow. Second operand has 6 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 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 21:40:19,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:19,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 364 [2023-08-25 21:40:19,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:19,722 INFO L124 PetriNetUnfolderBase]: 1003/2850 cut-off events. [2023-08-25 21:40:19,723 INFO L125 PetriNetUnfolderBase]: For 2066/2066 co-relation queries the response was YES. [2023-08-25 21:40:19,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7113 conditions, 2850 events. 1003/2850 cut-off events. For 2066/2066 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 16788 event pairs, 293 based on Foata normal form. 32/2840 useless extension candidates. Maximal degree in co-relation 7098. Up to 921 conditions per place. [2023-08-25 21:40:19,738 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 75 selfloop transitions, 13 changer transitions 0/101 dead transitions. [2023-08-25 21:40:19,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 101 transitions, 582 flow [2023-08-25 21:40:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 21:40:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 21:40:19,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1530 transitions. [2023-08-25 21:40:19,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5254120879120879 [2023-08-25 21:40:19,743 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1530 transitions. [2023-08-25 21:40:19,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1530 transitions. [2023-08-25 21:40:19,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:19,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1530 transitions. [2023-08-25 21:40:19,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 191.25) internal successors, (1530), 8 states have internal predecessors, (1530), 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 21:40:19,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 364.0) internal successors, (3276), 9 states have internal predecessors, (3276), 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 21:40:19,751 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 364.0) internal successors, (3276), 9 states have internal predecessors, (3276), 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 21:40:19,751 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 265 flow. Second operand 8 states and 1530 transitions. [2023-08-25 21:40:19,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 101 transitions, 582 flow [2023-08-25 21:40:19,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 101 transitions, 582 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:40:19,756 INFO L231 Difference]: Finished difference. Result has 82 places, 64 transitions, 322 flow [2023-08-25 21:40:19,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=322, PETRI_PLACES=82, PETRI_TRANSITIONS=64} [2023-08-25 21:40:19,757 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 21 predicate places. [2023-08-25 21:40:19,757 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 64 transitions, 322 flow [2023-08-25 21:40:19,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 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 21:40:19,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:19,758 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:40:19,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-25 21:40:19,758 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:19,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:19,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2085774691, now seen corresponding path program 5 times [2023-08-25 21:40:19,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:19,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869182740] [2023-08-25 21:40:19,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:19,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:40:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-08-25 21:40:20,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:40:20,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869182740] [2023-08-25 21:40:20,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869182740] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:40:20,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332152866] [2023-08-25 21:40:20,080 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-25 21:40:20,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:40:20,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:40:20,081 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:40:20,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 21:40:20,244 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-25 21:40:20,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:40:20,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-25 21:40:20,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:40:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-25 21:40:20,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:40:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-25 21:40:20,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332152866] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:40:20,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:40:20,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 6 [2023-08-25 21:40:20,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293086822] [2023-08-25 21:40:20,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:40:20,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-25 21:40:20,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:40:20,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-25 21:40:20,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-25 21:40:20,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 364 [2023-08-25 21:40:20,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 64 transitions, 322 flow. Second operand has 7 states, 7 states have (on average 189.57142857142858) internal successors, (1327), 7 states have internal predecessors, (1327), 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 21:40:20,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:40:20,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 364 [2023-08-25 21:40:20,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:40:20,921 INFO L124 PetriNetUnfolderBase]: 652/1853 cut-off events. [2023-08-25 21:40:20,921 INFO L125 PetriNetUnfolderBase]: For 2356/2356 co-relation queries the response was YES. [2023-08-25 21:40:20,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5085 conditions, 1853 events. 652/1853 cut-off events. For 2356/2356 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 8267 event pairs, 192 based on Foata normal form. 34/1865 useless extension candidates. Maximal degree in co-relation 5067. Up to 609 conditions per place. [2023-08-25 21:40:20,932 INFO L140 encePairwiseOnDemand]: 355/364 looper letters, 75 selfloop transitions, 11 changer transitions 0/99 dead transitions. [2023-08-25 21:40:20,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 99 transitions, 603 flow [2023-08-25 21:40:20,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 21:40:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 21:40:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1528 transitions. [2023-08-25 21:40:20,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247252747252747 [2023-08-25 21:40:20,936 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1528 transitions. [2023-08-25 21:40:20,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1528 transitions. [2023-08-25 21:40:20,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:40:20,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1528 transitions. [2023-08-25 21:40:20,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 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 21:40:20,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 364.0) internal successors, (3276), 9 states have internal predecessors, (3276), 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 21:40:20,944 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 364.0) internal successors, (3276), 9 states have internal predecessors, (3276), 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 21:40:20,944 INFO L175 Difference]: Start difference. First operand has 82 places, 64 transitions, 322 flow. Second operand 8 states and 1528 transitions. [2023-08-25 21:40:20,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 99 transitions, 603 flow [2023-08-25 21:40:20,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 99 transitions, 581 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-25 21:40:20,950 INFO L231 Difference]: Finished difference. Result has 82 places, 62 transitions, 302 flow [2023-08-25 21:40:20,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=302, PETRI_PLACES=82, PETRI_TRANSITIONS=62} [2023-08-25 21:40:20,951 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 21 predicate places. [2023-08-25 21:40:20,951 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 302 flow [2023-08-25 21:40:20,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 189.57142857142858) internal successors, (1327), 7 states have internal predecessors, (1327), 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 21:40:20,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:40:20,952 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:40:20,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 21:40:21,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:40:21,158 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 21:40:21,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:40:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1520517983, now seen corresponding path program 6 times [2023-08-25 21:40:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:40:21,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474319860] [2023-08-25 21:40:21,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:40:21,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:40:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 21:40:21,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 21:40:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 21:40:21,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 21:40:21,283 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 21:40:21,284 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (30 of 31 remaining) [2023-08-25 21:40:21,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2023-08-25 21:40:21,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2023-08-25 21:40:21,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2023-08-25 21:40:21,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2023-08-25 21:40:21,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2023-08-25 21:40:21,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2023-08-25 21:40:21,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2023-08-25 21:40:21,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2023-08-25 21:40:21,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2023-08-25 21:40:21,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2023-08-25 21:40:21,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2023-08-25 21:40:21,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2023-08-25 21:40:21,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2023-08-25 21:40:21,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2023-08-25 21:40:21,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2023-08-25 21:40:21,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2023-08-25 21:40:21,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2023-08-25 21:40:21,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 31 remaining) [2023-08-25 21:40:21,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 31 remaining) [2023-08-25 21:40:21,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2023-08-25 21:40:21,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2023-08-25 21:40:21,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2023-08-25 21:40:21,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2023-08-25 21:40:21,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2023-08-25 21:40:21,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2023-08-25 21:40:21,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2023-08-25 21:40:21,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2023-08-25 21:40:21,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2023-08-25 21:40:21,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2023-08-25 21:40:21,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2023-08-25 21:40:21,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-25 21:40:21,289 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:40:21,295 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 21:40:21,296 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 21:40:21,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 09:40:21 BasicIcfg [2023-08-25 21:40:21,379 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 21:40:21,380 INFO L158 Benchmark]: Toolchain (without parser) took 15185.37ms. Allocated memory was 381.7MB in the beginning and 696.3MB in the end (delta: 314.6MB). Free memory was 356.4MB in the beginning and 430.5MB in the end (delta: -74.0MB). Peak memory consumption was 241.0MB. Max. memory is 16.0GB. [2023-08-25 21:40:21,380 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 381.7MB. Free memory is still 357.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 21:40:21,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 594.12ms. Allocated memory is still 381.7MB. Free memory was 356.0MB in the beginning and 329.1MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-25 21:40:21,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.29ms. Allocated memory is still 381.7MB. Free memory was 329.1MB in the beginning and 326.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 21:40:21,380 INFO L158 Benchmark]: Boogie Preprocessor took 56.58ms. Allocated memory is still 381.7MB. Free memory was 326.6MB in the beginning and 324.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 21:40:21,381 INFO L158 Benchmark]: RCFGBuilder took 486.73ms. Allocated memory is still 381.7MB. Free memory was 324.5MB in the beginning and 354.1MB in the end (delta: -29.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.0GB. [2023-08-25 21:40:21,381 INFO L158 Benchmark]: TraceAbstraction took 13963.07ms. Allocated memory was 381.7MB in the beginning and 696.3MB in the end (delta: 314.6MB). Free memory was 353.1MB in the beginning and 430.5MB in the end (delta: -77.3MB). Peak memory consumption was 237.0MB. Max. memory is 16.0GB. [2023-08-25 21:40:21,382 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.14ms. Allocated memory is still 381.7MB. Free memory is still 357.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 594.12ms. Allocated memory is still 381.7MB. Free memory was 356.0MB in the beginning and 329.1MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 79.29ms. Allocated memory is still 381.7MB. Free memory was 329.1MB in the beginning and 326.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 56.58ms. Allocated memory is still 381.7MB. Free memory was 326.6MB in the beginning and 324.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 486.73ms. Allocated memory is still 381.7MB. Free memory was 324.5MB in the beginning and 354.1MB in the end (delta: -29.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.0GB. * TraceAbstraction took 13963.07ms. Allocated memory was 381.7MB in the beginning and 696.3MB in the end (delta: 314.6MB). Free memory was 353.1MB in the beginning and 430.5MB in the end (delta: -77.3MB). Peak memory consumption was 237.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 218]: Unsoundness Warning unspecified type, defaulting to int C: short [218] - GenericResultAtLocation [Line: 219]: Unsoundness Warning unspecified type, defaulting to int C: short [219] - GenericResultAtLocation [Line: 730]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [730] - GenericResultAtLocation [Line: 871]: Unsoundness Warning unspecified type, defaulting to int C: unsigned long [871] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 190 PlacesBefore, 61 PlacesAfterwards, 191 TransitionsBefore, 60 TransitionsAfterwards, 7052 CoEnabledTransitionPairs, 7 FixpointIterations, 78 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 158 TotalNumberOfCompositions, 19909 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9251, independent: 8829, independent conditional: 0, independent unconditional: 8829, dependent: 422, dependent conditional: 0, dependent unconditional: 422, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3606, independent: 3551, independent conditional: 0, independent unconditional: 3551, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9251, independent: 5278, independent conditional: 0, independent unconditional: 5278, dependent: 367, dependent conditional: 0, dependent unconditional: 367, unknown: 3606, unknown conditional: 0, unknown unconditional: 3606] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 361, Positive conditional cache size: 0, Positive unconditional cache size: 361, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, pthread_create(&t1, 0, thread1, 0)=9, t1={7:0}, t2={6:0}, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, pthread_create(&t2, 0, thread2, 0)=10, t1={7:0}, t2={6:0}, total=0] [L878] COND TRUE 1 i < 3 [L880] 1 num > 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L882] 1 num++ [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 [L894] 2 num == 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] EXPR 2 total + j [L896] 2 total = total + j [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num--=50, num=0, total=0] [L915] EXPR 0 \read(t1) [L915] 0 pthread_join(t1, 0) VAL [\read(t1)=9, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num--=50, num=0, t1={7:0}, t2={6:0}, total=0] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 [L880] 1 num > 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L882] 1 num++ [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 [L894] 2 num == 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] EXPR 2 total + j [L896] 2 total = total + j [L897] 2 num-- [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 [L880] 1 num > 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L882] 1 num++ [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 [L894] 2 num == 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) [L896] EXPR 2 total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=9, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1] [L916] EXPR 0 \read(t2) [L916] 0 pthread_join(t2, 0) VAL [\read(t2)=10, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1] [L896] EXPR 2 total + j [L896] 2 total = total + j [L897] 2 num-- [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] EXPR 2 total + j [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=10, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L917] 0 \read(flag) [L917] 0 \read(flag) [L917] COND TRUE 0 \read(flag) [L918] 0 total != ((3 * (3 + 1)) / 2) [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) [L919] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] - UnprovableResult [Line: 880]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 882]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 882]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 896]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 896]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 903]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 897]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 897]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 908]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 909]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 915]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 916]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 284 locations, 31 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.7s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 544 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 544 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1493 IncrementalHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 39 mSDtfsCounter, 1493 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 354 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=13, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 713 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 785 ConstructedInterpolants, 47 QuantifiedInterpolants, 2711 SizeOfPredicates, 11 NumberOfNonLiveVariables, 996 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 448/478 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-25 21:40:21,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...