/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 23:50:53,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 23:50:53,801 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 23:50:53,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 23:50:53,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 23:50:53,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 23:50:53,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 23:50:53,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 23:50:53,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 23:50:53,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 23:50:53,841 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 23:50:53,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 23:50:53,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 23:50:53,843 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 23:50:53,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 23:50:53,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 23:50:53,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 23:50:53,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 23:50:53,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 23:50:53,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 23:50:53,844 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 23:50:53,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 23:50:53,845 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 23:50:53,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 23:50:53,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 23:50:53,846 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 23:50:53,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 23:50:53,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 23:50:53,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 23:50:53,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 23:50:53,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 23:50:53,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 23:50:53,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 23:50:53,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 23:50:53,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 23:50:53,849 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 23:50:54,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 23:50:54,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 23:50:54,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 23:50:54,174 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 23:50:54,175 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 23:50:54,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2023-08-25 23:50:55,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 23:50:55,674 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 23:50:55,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2023-08-25 23:50:55,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31f62eb8/6955a60083754e66a04a900b7882557e/FLAG6fa73cfd5 [2023-08-25 23:50:55,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31f62eb8/6955a60083754e66a04a900b7882557e [2023-08-25 23:50:55,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 23:50:55,718 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 23:50:55,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 23:50:55,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 23:50:55,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 23:50:55,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 11:50:55" (1/1) ... [2023-08-25 23:50:55,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8bf9ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:55, skipping insertion in model container [2023-08-25 23:50:55,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 11:50:55" (1/1) ... [2023-08-25 23:50:55,776 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 23:50:56,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 23:50:56,176 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 23:50:56,192 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-25 23:50:56,194 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-25 23:50:56,236 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 23:50:56,266 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 23:50:56,267 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 23:50:56,273 INFO L206 MainTranslator]: Completed translation [2023-08-25 23:50:56,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:56 WrapperNode [2023-08-25 23:50:56,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 23:50:56,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 23:50:56,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 23:50:56,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 23:50:56,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:56" (1/1) ... [2023-08-25 23:50:56,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:56" (1/1) ... [2023-08-25 23:50:56,356 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 944 [2023-08-25 23:50:56,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 23:50:56,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 23:50:56,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 23:50:56,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 23:50:56,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:56" (1/1) ... [2023-08-25 23:50:56,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:56" (1/1) ... [2023-08-25 23:50:56,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:56" (1/1) ... [2023-08-25 23:50:56,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:56" (1/1) ... [2023-08-25 23:50:56,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:56" (1/1) ... [2023-08-25 23:50:56,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:56" (1/1) ... [2023-08-25 23:50:56,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:56" (1/1) ... [2023-08-25 23:50:56,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:56" (1/1) ... [2023-08-25 23:50:56,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 23:50:56,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 23:50:56,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 23:50:56,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 23:50:56,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:56" (1/1) ... [2023-08-25 23:50:56,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 23:50:56,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 23:50:56,470 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 23:50:56,478 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 23:50:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 23:50:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 23:50:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 23:50:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 23:50:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 23:50:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-25 23:50:56,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-25 23:50:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-25 23:50:56,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-25 23:50:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-25 23:50:56,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-25 23:50:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 23:50:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 23:50:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 23:50:56,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 23:50:56,504 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 23:50:56,666 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 23:50:56,667 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 23:50:57,864 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 23:51:16,100 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 23:51:16,100 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-25 23:51:16,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 11:51:16 BoogieIcfgContainer [2023-08-25 23:51:16,103 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 23:51:16,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 23:51:16,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 23:51:16,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 23:51:16,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 11:50:55" (1/3) ... [2023-08-25 23:51:16,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5d724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 11:51:16, skipping insertion in model container [2023-08-25 23:51:16,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:50:56" (2/3) ... [2023-08-25 23:51:16,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5d724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 11:51:16, skipping insertion in model container [2023-08-25 23:51:16,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 11:51:16" (3/3) ... [2023-08-25 23:51:16,110 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2023-08-25 23:51:16,124 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 23:51:16,125 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 249 error locations. [2023-08-25 23:51:16,125 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 23:51:18,478 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 23:51:18,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 372 places, 365 transitions, 745 flow [2023-08-25 23:51:19,834 INFO L124 PetriNetUnfolderBase]: 3/362 cut-off events. [2023-08-25 23:51:19,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 23:51:19,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 362 events. 3/362 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 2054 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 325. Up to 2 conditions per place. [2023-08-25 23:51:19,845 INFO L82 GeneralOperation]: Start removeDead. Operand has 372 places, 365 transitions, 745 flow [2023-08-25 23:51:19,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 369 places, 362 transitions, 733 flow [2023-08-25 23:51:19,863 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 23:51:19,872 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 369 places, 362 transitions, 733 flow [2023-08-25 23:51:19,874 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 369 places, 362 transitions, 733 flow [2023-08-25 23:51:19,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 369 places, 362 transitions, 733 flow [2023-08-25 23:51:20,873 INFO L124 PetriNetUnfolderBase]: 3/362 cut-off events. [2023-08-25 23:51:20,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 23:51:20,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 362 events. 3/362 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 2055 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 325. Up to 2 conditions per place. [2023-08-25 23:51:20,897 INFO L119 LiptonReduction]: Number of co-enabled transitions 61296 [2023-08-25 23:52:43,220 WARN L234 SmtUtils]: Spent 1.35m on a formula simplification. DAG size of input: 6074 DAG size of output: 1821 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:52:57,807 WARN L234 SmtUtils]: Spent 14.54s on a formula simplification. DAG size of input: 1696 DAG size of output: 1693 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:55:13,877 WARN L234 SmtUtils]: Spent 2.27m on a formula simplification. DAG size of input: 7561 DAG size of output: 2247 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:55:38,034 WARN L234 SmtUtils]: Spent 24.07s on a formula simplification. DAG size of input: 2092 DAG size of output: 2086 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:55:45,767 WARN L234 SmtUtils]: Spent 7.01s on a formula simplification that was a NOOP. DAG size: 1698 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:55:52,808 WARN L234 SmtUtils]: Spent 7.00s on a formula simplification that was a NOOP. DAG size: 1698 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:56:04,656 WARN L234 SmtUtils]: Spent 11.82s on a formula simplification that was a NOOP. DAG size: 2091 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:56:16,411 WARN L234 SmtUtils]: Spent 11.68s on a formula simplification that was a NOOP. DAG size: 2091 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:56:24,754 WARN L234 SmtUtils]: Spent 7.73s on a formula simplification. DAG size of input: 1699 DAG size of output: 885 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:56:44,591 WARN L234 SmtUtils]: Spent 17.05s on a formula simplification. DAG size of input: 2092 DAG size of output: 1182 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:57:13,156 WARN L234 SmtUtils]: Spent 23.66s on a formula simplification. DAG size of input: 1713 DAG size of output: 1710 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:57:24,760 WARN L234 SmtUtils]: Spent 11.56s on a formula simplification that was a NOOP. DAG size: 1710 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:57:59,122 WARN L234 SmtUtils]: Spent 34.33s on a formula simplification. DAG size of input: 2106 DAG size of output: 2103 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:58:16,944 WARN L234 SmtUtils]: Spent 17.74s on a formula simplification that was a NOOP. DAG size: 2103 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 23:58:21,040 INFO L134 LiptonReduction]: Checked pairs total: 651364 [2023-08-25 23:58:21,041 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-08-25 23:58:21,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 23:58:21,055 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;@4d692af, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 23:58:21,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 369 error locations. [2023-08-25 23:58:21,058 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 23:58:21,058 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-25 23:58:21,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 23:58:21,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 23:58:21,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-25 23:58:21,059 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONDATA_RACE === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-25 23:58:21,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 23:58:21,063 INFO L85 PathProgramCache]: Analyzing trace with hash 6492668, now seen corresponding path program 1 times [2023-08-25 23:58:21,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 23:58:21,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846460258] [2023-08-25 23:58:21,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 23:58:21,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 23:58:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 23:58:21,392 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 23:58:21,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 23:58:21,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846460258] [2023-08-25 23:58:21,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846460258] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 23:58:21,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 23:58:21,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 23:58:21,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552053707] [2023-08-25 23:58:21,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 23:58:21,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 23:58:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 23:58:21,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 23:58:21,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 23:58:21,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 505 [2023-08-25 23:58:21,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 271 transitions, 551 flow. Second operand has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 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 23:58:21,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 23:58:21,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 505 [2023-08-25 23:58:21,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 23:58:47,674 INFO L124 PetriNetUnfolderBase]: 2147/3118 cut-off events. [2023-08-25 23:58:47,674 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-08-25 23:58:47,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6313 conditions, 3118 events. 2147/3118 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13336 event pairs, 2147 based on Foata normal form. 0/2778 useless extension candidates. Maximal degree in co-relation 6302. Up to 3119 conditions per place. [2023-08-25 23:58:47,691 INFO L140 encePairwiseOnDemand]: 258/505 looper letters, 24 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-25 23:58:47,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 105 flow [2023-08-25 23:58:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 23:58:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 23:58:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 463 transitions. [2023-08-25 23:58:47,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45841584158415843 [2023-08-25 23:58:47,704 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 463 transitions. [2023-08-25 23:58:47,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 463 transitions. [2023-08-25 23:58:47,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 23:58:47,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 463 transitions. [2023-08-25 23:58:47,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 231.5) internal successors, (463), 2 states have internal predecessors, (463), 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 23:58:47,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 505.0) internal successors, (1515), 3 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 23:58:47,716 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 505.0) internal successors, (1515), 3 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 23:58:47,717 INFO L175 Difference]: Start difference. First operand has 281 places, 271 transitions, 551 flow. Second operand 2 states and 463 transitions. [2023-08-25 23:58:47,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 105 flow [2023-08-25 23:58:47,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-25 23:58:47,721 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-08-25 23:58:47,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-25 23:58:47,725 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -249 predicate places. [2023-08-25 23:58:47,725 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-08-25 23:58:47,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 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 23:58:47,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 23:58:47,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-25 23:58:47,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 23:58:47,726 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-25 23:58:47,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 23:58:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1944743399, now seen corresponding path program 1 times [2023-08-25 23:58:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 23:58:47,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452569317] [2023-08-25 23:58:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 23:58:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 23:58:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 23:58:47,983 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 23:58:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 23:58:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452569317] [2023-08-25 23:58:47,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452569317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 23:58:47,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 23:58:47,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 23:58:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414935917] [2023-08-25 23:58:47,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 23:58:47,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 23:58:47,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 23:58:47,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 23:58:47,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 23:58:47,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 505 [2023-08-25 23:58:47,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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 23:58:47,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 23:58:47,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 505 [2023-08-25 23:58:47,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 23:59:09,628 INFO L124 PetriNetUnfolderBase]: 1764/2575 cut-off events. [2023-08-25 23:59:09,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 23:59:09,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5215 conditions, 2575 events. 1764/2575 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11840 event pairs, 232 based on Foata normal form. 0/2425 useless extension candidates. Maximal degree in co-relation 5212. Up to 2173 conditions per place. [2023-08-25 23:59:09,637 INFO L140 encePairwiseOnDemand]: 502/505 looper letters, 34 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-08-25 23:59:09,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 160 flow [2023-08-25 23:59:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 23:59:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 23:59:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-25 23:59:09,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21386138613861386 [2023-08-25 23:59:09,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-25 23:59:09,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-25 23:59:09,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 23:59:09,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-25 23:59:09,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 23:59:09,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 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 23:59:09,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 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 23:59:09,647 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 324 transitions. [2023-08-25 23:59:09,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 160 flow [2023-08-25 23:59:09,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 23:59:09,649 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-25 23:59:09,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-25 23:59:09,650 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -248 predicate places. [2023-08-25 23:59:09,650 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-25 23:59:09,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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 23:59:09,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 23:59:09,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 23:59:09,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 23:59:09,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-25 23:59:09,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 23:59:09,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1936639109, now seen corresponding path program 1 times [2023-08-25 23:59:09,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 23:59:09,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070947631] [2023-08-25 23:59:09,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 23:59:09,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 23:59:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 23:59:09,978 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 23:59:09,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 23:59:09,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070947631] [2023-08-25 23:59:09,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070947631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 23:59:09,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 23:59:09,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 23:59:09,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293955901] [2023-08-25 23:59:09,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 23:59:09,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 23:59:09,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 23:59:09,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 23:59:09,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 23:59:09,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 505 [2023-08-25 23:59:09,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 23:59:09,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 23:59:09,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 505 [2023-08-25 23:59:09,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 23:59:21,373 INFO L124 PetriNetUnfolderBase]: 1269/1880 cut-off events. [2023-08-25 23:59:21,374 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2023-08-25 23:59:21,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 1880 events. 1269/1880 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7469 event pairs, 429 based on Foata normal form. 50/1930 useless extension candidates. Maximal degree in co-relation 3943. Up to 1316 conditions per place. [2023-08-25 23:59:21,379 INFO L140 encePairwiseOnDemand]: 502/505 looper letters, 30 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-25 23:59:21,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 140 flow [2023-08-25 23:59:21,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 23:59:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 23:59:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-08-25 23:59:21,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2099009900990099 [2023-08-25 23:59:21,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-08-25 23:59:21,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-08-25 23:59:21,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 23:59:21,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-08-25 23:59:21,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 23:59:21,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 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 23:59:21,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 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 23:59:21,387 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 3 states and 318 transitions. [2023-08-25 23:59:21,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 140 flow [2023-08-25 23:59:21,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 23:59:21,389 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 58 flow [2023-08-25 23:59:21,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-25 23:59:21,390 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -248 predicate places. [2023-08-25 23:59:21,390 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 58 flow [2023-08-25 23:59:21,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 23:59:21,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 23:59:21,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 23:59:21,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 23:59:21,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-25 23:59:21,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 23:59:21,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1375972306, now seen corresponding path program 1 times [2023-08-25 23:59:21,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 23:59:21,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542412833] [2023-08-25 23:59:21,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 23:59:21,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 23:59:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 23:59:23,787 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 23:59:23,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 23:59:23,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542412833] [2023-08-25 23:59:23,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542412833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 23:59:23,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 23:59:23,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 23:59:23,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799590206] [2023-08-25 23:59:23,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 23:59:23,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 23:59:23,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 23:59:23,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 23:59:23,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-25 23:59:23,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 505 [2023-08-25 23:59:23,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 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 23:59:23,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 23:59:23,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 505 [2023-08-25 23:59:23,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 23:59:34,968 INFO L124 PetriNetUnfolderBase]: 1247/1850 cut-off events. [2023-08-25 23:59:34,968 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2023-08-25 23:59:34,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4010 conditions, 1850 events. 1247/1850 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7634 event pairs, 581 based on Foata normal form. 8/1858 useless extension candidates. Maximal degree in co-relation 4005. Up to 1765 conditions per place. [2023-08-25 23:59:34,975 INFO L140 encePairwiseOnDemand]: 499/505 looper letters, 38 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2023-08-25 23:59:34,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 204 flow [2023-08-25 23:59:34,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 23:59:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 23:59:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 410 transitions. [2023-08-25 23:59:34,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20297029702970298 [2023-08-25 23:59:34,979 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 410 transitions. [2023-08-25 23:59:34,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 410 transitions. [2023-08-25 23:59:34,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 23:59:34,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 410 transitions. [2023-08-25 23:59:34,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 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 23:59:34,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 505.0) internal successors, (2525), 5 states have internal predecessors, (2525), 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 23:59:34,986 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 505.0) internal successors, (2525), 5 states have internal predecessors, (2525), 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 23:59:34,986 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 58 flow. Second operand 4 states and 410 transitions. [2023-08-25 23:59:34,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 204 flow [2023-08-25 23:59:34,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 23:59:34,988 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 99 flow [2023-08-25 23:59:34,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-25 23:59:34,990 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -245 predicate places. [2023-08-25 23:59:34,990 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 99 flow [2023-08-25 23:59:34,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 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 23:59:34,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 23:59:34,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 23:59:34,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 23:59:34,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-25 23:59:34,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 23:59:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash 305117686, now seen corresponding path program 1 times [2023-08-25 23:59:34,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 23:59:34,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733087956] [2023-08-25 23:59:34,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 23:59:34,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 23:59:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 23:59:37,748 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 23:59:37,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 23:59:37,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733087956] [2023-08-25 23:59:37,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733087956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 23:59:37,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 23:59:37,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 23:59:37,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754832322] [2023-08-25 23:59:37,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 23:59:37,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 23:59:37,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 23:59:37,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 23:59:37,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 23:59:37,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 505 [2023-08-25 23:59:37,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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 23:59:37,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 23:59:37,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 505 [2023-08-25 23:59:37,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 23:59:48,954 INFO L124 PetriNetUnfolderBase]: 1223/1818 cut-off events. [2023-08-25 23:59:48,955 INFO L125 PetriNetUnfolderBase]: For 582/582 co-relation queries the response was YES. [2023-08-25 23:59:48,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 1818 events. 1223/1818 cut-off events. For 582/582 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7439 event pairs, 515 based on Foata normal form. 8/1826 useless extension candidates. Maximal degree in co-relation 4486. Up to 1599 conditions per place. [2023-08-25 23:59:48,961 INFO L140 encePairwiseOnDemand]: 499/505 looper letters, 42 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2023-08-25 23:59:48,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 273 flow [2023-08-25 23:59:48,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 23:59:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 23:59:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2023-08-25 23:59:48,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.201980198019802 [2023-08-25 23:59:48,965 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 408 transitions. [2023-08-25 23:59:48,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 408 transitions. [2023-08-25 23:59:48,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 23:59:48,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 408 transitions. [2023-08-25 23:59:48,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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 23:59:48,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 505.0) internal successors, (2525), 5 states have internal predecessors, (2525), 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 23:59:48,971 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 505.0) internal successors, (2525), 5 states have internal predecessors, (2525), 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 23:59:48,971 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 99 flow. Second operand 4 states and 408 transitions. [2023-08-25 23:59:48,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 273 flow [2023-08-25 23:59:48,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 23:59:48,974 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 167 flow [2023-08-25 23:59:48,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-08-25 23:59:48,974 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -240 predicate places. [2023-08-25 23:59:48,975 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 167 flow [2023-08-25 23:59:48,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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 23:59:48,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 23:59:48,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 23:59:48,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 23:59:48,975 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-25 23:59:48,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 23:59:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1855806585, now seen corresponding path program 1 times [2023-08-25 23:59:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 23:59:48,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760170466] [2023-08-25 23:59:48,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 23:59:48,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 23:59:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 23:59:50,423 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 23:59:50,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 23:59:50,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760170466] [2023-08-25 23:59:50,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760170466] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 23:59:50,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 23:59:50,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 23:59:50,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119428980] [2023-08-25 23:59:50,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 23:59:50,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 23:59:50,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 23:59:50,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 23:59:50,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-25 23:59:50,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 505 [2023-08-25 23:59:50,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 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 23:59:50,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 23:59:50,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 505 [2023-08-25 23:59:50,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 00:00:01,823 INFO L124 PetriNetUnfolderBase]: 1215/1808 cut-off events. [2023-08-26 00:00:01,824 INFO L125 PetriNetUnfolderBase]: For 1164/1164 co-relation queries the response was YES. [2023-08-26 00:00:01,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5004 conditions, 1808 events. 1215/1808 cut-off events. For 1164/1164 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7536 event pairs, 300 based on Foata normal form. 16/1824 useless extension candidates. Maximal degree in co-relation 4994. Up to 1543 conditions per place. [2023-08-26 00:00:01,832 INFO L140 encePairwiseOnDemand]: 498/505 looper letters, 47 selfloop transitions, 12 changer transitions 0/59 dead transitions. [2023-08-26 00:00:01,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 357 flow [2023-08-26 00:00:01,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 00:00:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 00:00:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 422 transitions. [2023-08-26 00:00:01,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2089108910891089 [2023-08-26 00:00:01,836 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 422 transitions. [2023-08-26 00:00:01,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 422 transitions. [2023-08-26 00:00:01,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 00:00:01,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 422 transitions. [2023-08-26 00:00:01,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:01,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 505.0) internal successors, (2525), 5 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:01,841 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 505.0) internal successors, (2525), 5 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:01,841 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 167 flow. Second operand 4 states and 422 transitions. [2023-08-26 00:00:01,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 357 flow [2023-08-26 00:00:01,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 355 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 00:00:01,846 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 233 flow [2023-08-26 00:00:01,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-26 00:00:01,846 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -235 predicate places. [2023-08-26 00:00:01,847 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 233 flow [2023-08-26 00:00:01,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:01,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 00:00:01,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 00:00:01,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 00:00:01,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-26 00:00:01,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 00:00:01,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1695809679, now seen corresponding path program 1 times [2023-08-26 00:00:01,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 00:00:01,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795420516] [2023-08-26 00:00:01,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 00:00:01,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 00:00:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 00:00:05,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-26 00:00:05,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 00:00:05,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795420516] [2023-08-26 00:00:05,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795420516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 00:00:05,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 00:00:05,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 00:00:05,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189207959] [2023-08-26 00:00:05,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 00:00:05,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 00:00:05,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 00:00:05,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 00:00:05,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 00:00:05,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 505 [2023-08-26 00:00:05,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:05,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 00:00:05,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 505 [2023-08-26 00:00:05,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 00:00:19,509 INFO L124 PetriNetUnfolderBase]: 1313/1946 cut-off events. [2023-08-26 00:00:19,510 INFO L125 PetriNetUnfolderBase]: For 2316/2316 co-relation queries the response was YES. [2023-08-26 00:00:19,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6153 conditions, 1946 events. 1313/1946 cut-off events. For 2316/2316 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8220 event pairs, 288 based on Foata normal form. 8/1954 useless extension candidates. Maximal degree in co-relation 6140. Up to 1589 conditions per place. [2023-08-26 00:00:19,519 INFO L140 encePairwiseOnDemand]: 497/505 looper letters, 56 selfloop transitions, 15 changer transitions 0/71 dead transitions. [2023-08-26 00:00:19,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 478 flow [2023-08-26 00:00:19,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 00:00:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 00:00:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2023-08-26 00:00:19,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20633663366336633 [2023-08-26 00:00:19,526 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 521 transitions. [2023-08-26 00:00:19,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 521 transitions. [2023-08-26 00:00:19,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 00:00:19,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 521 transitions. [2023-08-26 00:00:19,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:19,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 505.0) internal successors, (3030), 6 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:19,531 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 505.0) internal successors, (3030), 6 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:19,531 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 233 flow. Second operand 5 states and 521 transitions. [2023-08-26 00:00:19,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 478 flow [2023-08-26 00:00:19,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 456 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-26 00:00:19,540 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 269 flow [2023-08-26 00:00:19,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-26 00:00:19,540 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -232 predicate places. [2023-08-26 00:00:19,541 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 269 flow [2023-08-26 00:00:19,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:19,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 00:00:19,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 00:00:19,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 00:00:19,542 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-26 00:00:19,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 00:00:19,542 INFO L85 PathProgramCache]: Analyzing trace with hash -113257565, now seen corresponding path program 2 times [2023-08-26 00:00:19,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 00:00:19,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328909237] [2023-08-26 00:00:19,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 00:00:19,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 00:00:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 00:00:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 00:00:22,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 00:00:22,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328909237] [2023-08-26 00:00:22,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328909237] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 00:00:22,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 00:00:22,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 00:00:22,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15447489] [2023-08-26 00:00:22,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 00:00:22,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 00:00:22,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 00:00:22,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 00:00:22,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 00:00:22,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 505 [2023-08-26 00:00:22,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:22,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 00:00:22,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 505 [2023-08-26 00:00:22,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 00:00:37,077 INFO L124 PetriNetUnfolderBase]: 1338/1985 cut-off events. [2023-08-26 00:00:37,078 INFO L125 PetriNetUnfolderBase]: For 3122/3122 co-relation queries the response was YES. [2023-08-26 00:00:37,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6676 conditions, 1985 events. 1338/1985 cut-off events. For 3122/3122 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8418 event pairs, 299 based on Foata normal form. 8/1993 useless extension candidates. Maximal degree in co-relation 6663. Up to 1605 conditions per place. [2023-08-26 00:00:37,087 INFO L140 encePairwiseOnDemand]: 498/505 looper letters, 57 selfloop transitions, 20 changer transitions 0/77 dead transitions. [2023-08-26 00:00:37,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 77 transitions, 560 flow [2023-08-26 00:00:37,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 00:00:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 00:00:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2023-08-26 00:00:37,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20633663366336633 [2023-08-26 00:00:37,090 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 521 transitions. [2023-08-26 00:00:37,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 521 transitions. [2023-08-26 00:00:37,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 00:00:37,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 521 transitions. [2023-08-26 00:00:37,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:37,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 505.0) internal successors, (3030), 6 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:37,095 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 505.0) internal successors, (3030), 6 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:37,095 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 269 flow. Second operand 5 states and 521 transitions. [2023-08-26 00:00:37,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 77 transitions, 560 flow [2023-08-26 00:00:37,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 528 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 00:00:37,101 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 352 flow [2023-08-26 00:00:37,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=352, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-08-26 00:00:37,102 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -229 predicate places. [2023-08-26 00:00:37,102 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 352 flow [2023-08-26 00:00:37,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:37,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 00:00:37,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 00:00:37,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 00:00:37,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-26 00:00:37,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 00:00:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1700105349, now seen corresponding path program 3 times [2023-08-26 00:00:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 00:00:37,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693194491] [2023-08-26 00:00:37,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 00:00:37,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 00:00:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 00:00:39,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 00:00:39,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 00:00:39,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693194491] [2023-08-26 00:00:39,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693194491] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 00:00:39,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 00:00:39,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 00:00:39,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899812095] [2023-08-26 00:00:39,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 00:00:39,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 00:00:39,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 00:00:39,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 00:00:39,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 00:00:39,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 505 [2023-08-26 00:00:39,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 352 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:39,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 00:00:39,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 505 [2023-08-26 00:00:39,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 00:00:57,475 INFO L124 PetriNetUnfolderBase]: 1586/2357 cut-off events. [2023-08-26 00:00:57,476 INFO L125 PetriNetUnfolderBase]: For 6112/6112 co-relation queries the response was YES. [2023-08-26 00:00:57,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8511 conditions, 2357 events. 1586/2357 cut-off events. For 6112/6112 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10563 event pairs, 207 based on Foata normal form. 36/2393 useless extension candidates. Maximal degree in co-relation 8496. Up to 1391 conditions per place. [2023-08-26 00:00:57,487 INFO L140 encePairwiseOnDemand]: 498/505 looper letters, 63 selfloop transitions, 23 changer transitions 0/86 dead transitions. [2023-08-26 00:00:57,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 699 flow [2023-08-26 00:00:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 00:00:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 00:00:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2023-08-26 00:00:57,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20356435643564355 [2023-08-26 00:00:57,491 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 514 transitions. [2023-08-26 00:00:57,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 514 transitions. [2023-08-26 00:00:57,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 00:00:57,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 514 transitions. [2023-08-26 00:00:57,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:57,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 505.0) internal successors, (3030), 6 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:57,497 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 505.0) internal successors, (3030), 6 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:57,497 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 352 flow. Second operand 5 states and 514 transitions. [2023-08-26 00:00:57,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 699 flow [2023-08-26 00:00:57,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 674 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-08-26 00:00:57,509 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 483 flow [2023-08-26 00:00:57,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=483, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2023-08-26 00:00:57,509 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -224 predicate places. [2023-08-26 00:00:57,510 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 483 flow [2023-08-26 00:00:57,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:57,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 00:00:57,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 00:00:57,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 00:00:57,510 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-26 00:00:57,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 00:00:57,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1169372357, now seen corresponding path program 1 times [2023-08-26 00:00:57,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 00:00:57,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482311172] [2023-08-26 00:00:57,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 00:00:57,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 00:00:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 00:00:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 00:00:57,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 00:00:57,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482311172] [2023-08-26 00:00:57,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482311172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 00:00:57,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 00:00:57,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 00:00:57,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374472470] [2023-08-26 00:00:57,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 00:00:57,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 00:00:57,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 00:00:57,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 00:00:57,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 00:00:57,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 505 [2023-08-26 00:00:57,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 483 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:00:57,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 00:00:57,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 505 [2023-08-26 00:00:57,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 00:01:21,860 INFO L124 PetriNetUnfolderBase]: 2133/3201 cut-off events. [2023-08-26 00:01:21,860 INFO L125 PetriNetUnfolderBase]: For 15192/15192 co-relation queries the response was YES. [2023-08-26 00:01:21,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12999 conditions, 3201 events. 2133/3201 cut-off events. For 15192/15192 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15238 event pairs, 269 based on Foata normal form. 54/3255 useless extension candidates. Maximal degree in co-relation 12982. Up to 1662 conditions per place. [2023-08-26 00:01:21,874 INFO L140 encePairwiseOnDemand]: 502/505 looper letters, 90 selfloop transitions, 2 changer transitions 19/111 dead transitions. [2023-08-26 00:01:21,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 111 transitions, 1220 flow [2023-08-26 00:01:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 00:01:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 00:01:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 421 transitions. [2023-08-26 00:01:21,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2084158415841584 [2023-08-26 00:01:21,877 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 421 transitions. [2023-08-26 00:01:21,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 421 transitions. [2023-08-26 00:01:21,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 00:01:21,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 421 transitions. [2023-08-26 00:01:21,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:21,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 505.0) internal successors, (2525), 5 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:21,882 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 505.0) internal successors, (2525), 5 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:21,882 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 483 flow. Second operand 4 states and 421 transitions. [2023-08-26 00:01:21,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 111 transitions, 1220 flow [2023-08-26 00:01:21,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 1112 flow, removed 48 selfloop flow, removed 1 redundant places. [2023-08-26 00:01:21,901 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 449 flow [2023-08-26 00:01:21,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-08-26 00:01:21,902 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -220 predicate places. [2023-08-26 00:01:21,902 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 449 flow [2023-08-26 00:01:21,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:21,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 00:01:21,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 00:01:21,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 00:01:21,903 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-26 00:01:21,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 00:01:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1067524833, now seen corresponding path program 2 times [2023-08-26 00:01:21,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 00:01:21,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943509290] [2023-08-26 00:01:21,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 00:01:21,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 00:01:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 00:01:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 00:01:22,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 00:01:22,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943509290] [2023-08-26 00:01:22,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943509290] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 00:01:22,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 00:01:22,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 00:01:22,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474331356] [2023-08-26 00:01:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 00:01:22,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 00:01:22,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 00:01:22,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 00:01:22,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 00:01:22,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 505 [2023-08-26 00:01:22,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:22,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 00:01:22,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 505 [2023-08-26 00:01:22,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 00:01:36,031 INFO L124 PetriNetUnfolderBase]: 1113/1827 cut-off events. [2023-08-26 00:01:36,032 INFO L125 PetriNetUnfolderBase]: For 6921/6921 co-relation queries the response was YES. [2023-08-26 00:01:36,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7344 conditions, 1827 events. 1113/1827 cut-off events. For 6921/6921 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8838 event pairs, 234 based on Foata normal form. 147/1974 useless extension candidates. Maximal degree in co-relation 7324. Up to 1385 conditions per place. [2023-08-26 00:01:36,039 INFO L140 encePairwiseOnDemand]: 500/505 looper letters, 69 selfloop transitions, 4 changer transitions 6/79 dead transitions. [2023-08-26 00:01:36,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 757 flow [2023-08-26 00:01:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 00:01:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 00:01:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-08-26 00:01:36,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2145214521452145 [2023-08-26 00:01:36,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-08-26 00:01:36,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-08-26 00:01:36,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 00:01:36,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-08-26 00:01:36,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:36,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:36,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:36,050 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 449 flow. Second operand 3 states and 325 transitions. [2023-08-26 00:01:36,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 757 flow [2023-08-26 00:01:36,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 79 transitions, 737 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 00:01:36,060 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 385 flow [2023-08-26 00:01:36,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-08-26 00:01:36,060 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -220 predicate places. [2023-08-26 00:01:36,061 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 385 flow [2023-08-26 00:01:36,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:36,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 00:01:36,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 00:01:36,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 00:01:36,061 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-26 00:01:36,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 00:01:36,063 INFO L85 PathProgramCache]: Analyzing trace with hash -524553085, now seen corresponding path program 1 times [2023-08-26 00:01:36,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 00:01:36,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33201815] [2023-08-26 00:01:36,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 00:01:36,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 00:01:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 00:01:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 00:01:36,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 00:01:36,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33201815] [2023-08-26 00:01:36,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33201815] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 00:01:36,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 00:01:36,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 00:01:36,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880086408] [2023-08-26 00:01:36,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 00:01:36,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 00:01:36,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 00:01:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 00:01:36,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 00:01:36,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 505 [2023-08-26 00:01:36,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:36,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 00:01:36,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 505 [2023-08-26 00:01:36,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 00:01:44,141 INFO L124 PetriNetUnfolderBase]: 574/1003 cut-off events. [2023-08-26 00:01:44,141 INFO L125 PetriNetUnfolderBase]: For 3409/3409 co-relation queries the response was YES. [2023-08-26 00:01:44,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4372 conditions, 1003 events. 574/1003 cut-off events. For 3409/3409 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4486 event pairs, 164 based on Foata normal form. 114/1117 useless extension candidates. Maximal degree in co-relation 4352. Up to 443 conditions per place. [2023-08-26 00:01:44,146 INFO L140 encePairwiseOnDemand]: 500/505 looper letters, 76 selfloop transitions, 7 changer transitions 7/90 dead transitions. [2023-08-26 00:01:44,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 90 transitions, 833 flow [2023-08-26 00:01:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 00:01:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 00:01:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2023-08-26 00:01:44,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21534653465346534 [2023-08-26 00:01:44,150 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2023-08-26 00:01:44,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2023-08-26 00:01:44,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 00:01:44,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2023-08-26 00:01:44,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:44,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 505.0) internal successors, (2525), 5 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:44,154 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 505.0) internal successors, (2525), 5 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:44,154 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 385 flow. Second operand 4 states and 435 transitions. [2023-08-26 00:01:44,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 90 transitions, 833 flow [2023-08-26 00:01:44,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 758 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-08-26 00:01:44,161 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 352 flow [2023-08-26 00:01:44,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-08-26 00:01:44,162 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -222 predicate places. [2023-08-26 00:01:44,162 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 352 flow [2023-08-26 00:01:44,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:44,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 00:01:44,163 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-26 00:01:44,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 00:01:44,163 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-26 00:01:44,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 00:01:44,163 INFO L85 PathProgramCache]: Analyzing trace with hash 444324817, now seen corresponding path program 1 times [2023-08-26 00:01:44,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 00:01:44,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988826199] [2023-08-26 00:01:44,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 00:01:44,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 00:01:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 00:01:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 00:01:45,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 00:01:45,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988826199] [2023-08-26 00:01:45,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988826199] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 00:01:45,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 00:01:45,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 00:01:45,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161016542] [2023-08-26 00:01:45,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 00:01:45,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 00:01:45,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 00:01:45,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 00:01:45,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 00:01:45,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 505 [2023-08-26 00:01:45,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:45,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 00:01:45,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 505 [2023-08-26 00:01:45,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 00:01:51,594 INFO L124 PetriNetUnfolderBase]: 515/881 cut-off events. [2023-08-26 00:01:51,595 INFO L125 PetriNetUnfolderBase]: For 2662/2662 co-relation queries the response was YES. [2023-08-26 00:01:51,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3756 conditions, 881 events. 515/881 cut-off events. For 2662/2662 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3864 event pairs, 159 based on Foata normal form. 25/906 useless extension candidates. Maximal degree in co-relation 3737. Up to 443 conditions per place. [2023-08-26 00:01:51,597 INFO L140 encePairwiseOnDemand]: 500/505 looper letters, 59 selfloop transitions, 10 changer transitions 21/90 dead transitions. [2023-08-26 00:01:51,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 786 flow [2023-08-26 00:01:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 00:01:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 00:01:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2023-08-26 00:01:51,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2099009900990099 [2023-08-26 00:01:51,601 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2023-08-26 00:01:51,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2023-08-26 00:01:51,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 00:01:51,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2023-08-26 00:01:51,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:51,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 505.0) internal successors, (3030), 6 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:51,606 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 505.0) internal successors, (3030), 6 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:51,606 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 352 flow. Second operand 5 states and 530 transitions. [2023-08-26 00:01:51,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 786 flow [2023-08-26 00:01:51,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 90 transitions, 725 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-08-26 00:01:51,611 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 286 flow [2023-08-26 00:01:51,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2023-08-26 00:01:51,613 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -221 predicate places. [2023-08-26 00:01:51,613 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 286 flow [2023-08-26 00:01:51,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:51,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 00:01:51,614 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-26 00:01:51,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 00:01:51,614 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-26 00:01:51,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 00:01:51,614 INFO L85 PathProgramCache]: Analyzing trace with hash 687050103, now seen corresponding path program 1 times [2023-08-26 00:01:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 00:01:51,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738523461] [2023-08-26 00:01:51,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 00:01:51,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 00:01:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 00:01:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 00:01:52,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 00:01:52,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738523461] [2023-08-26 00:01:52,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738523461] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 00:01:52,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 00:01:52,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 00:01:52,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360449878] [2023-08-26 00:01:52,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 00:01:52,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 00:01:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 00:01:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 00:01:52,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 00:01:52,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 505 [2023-08-26 00:01:52,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:52,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 00:01:52,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 505 [2023-08-26 00:01:52,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 00:01:57,293 INFO L124 PetriNetUnfolderBase]: 373/686 cut-off events. [2023-08-26 00:01:57,294 INFO L125 PetriNetUnfolderBase]: For 2124/2124 co-relation queries the response was YES. [2023-08-26 00:01:57,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2971 conditions, 686 events. 373/686 cut-off events. For 2124/2124 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3027 event pairs, 73 based on Foata normal form. 1/687 useless extension candidates. Maximal degree in co-relation 2953. Up to 470 conditions per place. [2023-08-26 00:01:57,296 INFO L140 encePairwiseOnDemand]: 502/505 looper letters, 41 selfloop transitions, 1 changer transitions 49/91 dead transitions. [2023-08-26 00:01:57,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 810 flow [2023-08-26 00:01:57,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 00:01:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 00:01:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 422 transitions. [2023-08-26 00:01:57,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2089108910891089 [2023-08-26 00:01:57,299 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 422 transitions. [2023-08-26 00:01:57,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 422 transitions. [2023-08-26 00:01:57,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 00:01:57,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 422 transitions. [2023-08-26 00:01:57,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:57,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 505.0) internal successors, (2525), 5 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:57,304 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 505.0) internal successors, (2525), 5 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:57,304 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 286 flow. Second operand 4 states and 422 transitions. [2023-08-26 00:01:57,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 810 flow [2023-08-26 00:01:57,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 91 transitions, 740 flow, removed 16 selfloop flow, removed 5 redundant places. [2023-08-26 00:01:57,309 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 193 flow [2023-08-26 00:01:57,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=505, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2023-08-26 00:01:57,310 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -223 predicate places. [2023-08-26 00:01:57,311 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 34 transitions, 193 flow [2023-08-26 00:01:57,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 00:01:57,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 00:01:57,311 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-26 00:01:57,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 00:01:57,311 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 365 more)] === [2023-08-26 00:01:57,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 00:01:57,316 INFO L85 PathProgramCache]: Analyzing trace with hash 481506621, now seen corresponding path program 2 times [2023-08-26 00:01:57,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 00:01:57,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732164586] [2023-08-26 00:01:57,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 00:01:57,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 00:01:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 00:01:57,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 00:01:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 00:01:58,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 00:01:58,175 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 00:01:58,177 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONASSERT (368 of 369 remaining) [2023-08-26 00:01:58,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONDATA_RACE (367 of 369 remaining) [2023-08-26 00:01:58,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONDATA_RACE (366 of 369 remaining) [2023-08-26 00:01:58,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONDATA_RACE (365 of 369 remaining) [2023-08-26 00:01:58,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONDATA_RACE (364 of 369 remaining) [2023-08-26 00:01:58,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONDATA_RACE (363 of 369 remaining) [2023-08-26 00:01:58,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONDATA_RACE (362 of 369 remaining) [2023-08-26 00:01:58,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6ASSERT_VIOLATIONDATA_RACE (361 of 369 remaining) [2023-08-26 00:01:58,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7ASSERT_VIOLATIONDATA_RACE (360 of 369 remaining) [2023-08-26 00:01:58,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8ASSERT_VIOLATIONDATA_RACE (359 of 369 remaining) [2023-08-26 00:01:58,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9ASSERT_VIOLATIONDATA_RACE (358 of 369 remaining) [2023-08-26 00:01:58,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10ASSERT_VIOLATIONDATA_RACE (357 of 369 remaining) [2023-08-26 00:01:58,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11ASSERT_VIOLATIONDATA_RACE (356 of 369 remaining) [2023-08-26 00:01:58,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12ASSERT_VIOLATIONDATA_RACE (355 of 369 remaining) [2023-08-26 00:01:58,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13ASSERT_VIOLATIONDATA_RACE (354 of 369 remaining) [2023-08-26 00:01:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14ASSERT_VIOLATIONDATA_RACE (353 of 369 remaining) [2023-08-26 00:01:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15ASSERT_VIOLATIONDATA_RACE (352 of 369 remaining) [2023-08-26 00:01:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err16ASSERT_VIOLATIONDATA_RACE (351 of 369 remaining) [2023-08-26 00:01:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err17ASSERT_VIOLATIONDATA_RACE (350 of 369 remaining) [2023-08-26 00:01:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err18ASSERT_VIOLATIONDATA_RACE (349 of 369 remaining) [2023-08-26 00:01:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err19ASSERT_VIOLATIONDATA_RACE (348 of 369 remaining) [2023-08-26 00:01:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err20ASSERT_VIOLATIONDATA_RACE (347 of 369 remaining) [2023-08-26 00:01:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err21ASSERT_VIOLATIONDATA_RACE (346 of 369 remaining) [2023-08-26 00:01:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err22ASSERT_VIOLATIONDATA_RACE (345 of 369 remaining) [2023-08-26 00:01:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err23ASSERT_VIOLATIONDATA_RACE (344 of 369 remaining) [2023-08-26 00:01:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err24ASSERT_VIOLATIONDATA_RACE (343 of 369 remaining) [2023-08-26 00:01:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err25ASSERT_VIOLATIONDATA_RACE (342 of 369 remaining) [2023-08-26 00:01:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err26ASSERT_VIOLATIONDATA_RACE (341 of 369 remaining) [2023-08-26 00:01:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err27ASSERT_VIOLATIONDATA_RACE (340 of 369 remaining) [2023-08-26 00:01:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err28ASSERT_VIOLATIONDATA_RACE (339 of 369 remaining) [2023-08-26 00:01:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err29ASSERT_VIOLATIONDATA_RACE (338 of 369 remaining) [2023-08-26 00:01:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err30ASSERT_VIOLATIONDATA_RACE (337 of 369 remaining) [2023-08-26 00:01:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err31ASSERT_VIOLATIONDATA_RACE (336 of 369 remaining) [2023-08-26 00:01:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONDATA_RACE (335 of 369 remaining) [2023-08-26 00:01:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONDATA_RACE (334 of 369 remaining) [2023-08-26 00:01:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONDATA_RACE (333 of 369 remaining) [2023-08-26 00:01:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONDATA_RACE (332 of 369 remaining) [2023-08-26 00:01:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONDATA_RACE (331 of 369 remaining) [2023-08-26 00:01:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONDATA_RACE (330 of 369 remaining) [2023-08-26 00:01:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6ASSERT_VIOLATIONDATA_RACE (329 of 369 remaining) [2023-08-26 00:01:58,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7ASSERT_VIOLATIONDATA_RACE (328 of 369 remaining) [2023-08-26 00:01:58,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8ASSERT_VIOLATIONASSERT (327 of 369 remaining) [2023-08-26 00:01:58,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9ASSERT_VIOLATIONDATA_RACE (326 of 369 remaining) [2023-08-26 00:01:58,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10ASSERT_VIOLATIONDATA_RACE (325 of 369 remaining) [2023-08-26 00:01:58,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11ASSERT_VIOLATIONDATA_RACE (324 of 369 remaining) [2023-08-26 00:01:58,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12ASSERT_VIOLATIONDATA_RACE (323 of 369 remaining) [2023-08-26 00:01:58,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13ASSERT_VIOLATIONDATA_RACE (322 of 369 remaining) [2023-08-26 00:01:58,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14ASSERT_VIOLATIONDATA_RACE (321 of 369 remaining) [2023-08-26 00:01:58,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15ASSERT_VIOLATIONDATA_RACE (320 of 369 remaining) [2023-08-26 00:01:58,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16ASSERT_VIOLATIONDATA_RACE (319 of 369 remaining) [2023-08-26 00:01:58,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17ASSERT_VIOLATIONDATA_RACE (318 of 369 remaining) [2023-08-26 00:01:58,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18ASSERT_VIOLATIONDATA_RACE (317 of 369 remaining) [2023-08-26 00:01:58,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19ASSERT_VIOLATIONDATA_RACE (316 of 369 remaining) [2023-08-26 00:01:58,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err20ASSERT_VIOLATIONDATA_RACE (315 of 369 remaining) [2023-08-26 00:01:58,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err21ASSERT_VIOLATIONDATA_RACE (314 of 369 remaining) [2023-08-26 00:01:58,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err22ASSERT_VIOLATIONDATA_RACE (313 of 369 remaining) [2023-08-26 00:01:58,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err23ASSERT_VIOLATIONDATA_RACE (312 of 369 remaining) [2023-08-26 00:01:58,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err24ASSERT_VIOLATIONDATA_RACE (311 of 369 remaining) [2023-08-26 00:01:58,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err26ASSERT_VIOLATIONDATA_RACE (310 of 369 remaining) [2023-08-26 00:01:58,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err25ASSERT_VIOLATIONDATA_RACE (309 of 369 remaining) [2023-08-26 00:01:58,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err27ASSERT_VIOLATIONDATA_RACE (308 of 369 remaining) [2023-08-26 00:01:58,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err28ASSERT_VIOLATIONDATA_RACE (307 of 369 remaining) [2023-08-26 00:01:58,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err29ASSERT_VIOLATIONDATA_RACE (306 of 369 remaining) [2023-08-26 00:01:58,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err30ASSERT_VIOLATIONDATA_RACE (305 of 369 remaining) [2023-08-26 00:01:58,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err31ASSERT_VIOLATIONDATA_RACE (304 of 369 remaining) [2023-08-26 00:01:58,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err32ASSERT_VIOLATIONDATA_RACE (303 of 369 remaining) [2023-08-26 00:01:58,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err33ASSERT_VIOLATIONDATA_RACE (302 of 369 remaining) [2023-08-26 00:01:58,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err34ASSERT_VIOLATIONDATA_RACE (301 of 369 remaining) [2023-08-26 00:01:58,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err35ASSERT_VIOLATIONDATA_RACE (300 of 369 remaining) [2023-08-26 00:01:58,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err36ASSERT_VIOLATIONDATA_RACE (299 of 369 remaining) [2023-08-26 00:01:58,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err37ASSERT_VIOLATIONDATA_RACE (298 of 369 remaining) [2023-08-26 00:01:58,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err38ASSERT_VIOLATIONDATA_RACE (297 of 369 remaining) [2023-08-26 00:01:58,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err39ASSERT_VIOLATIONDATA_RACE (296 of 369 remaining) [2023-08-26 00:01:58,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err40ASSERT_VIOLATIONDATA_RACE (295 of 369 remaining) [2023-08-26 00:01:58,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err41ASSERT_VIOLATIONDATA_RACE (294 of 369 remaining) [2023-08-26 00:01:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err42ASSERT_VIOLATIONDATA_RACE (293 of 369 remaining) [2023-08-26 00:01:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err43ASSERT_VIOLATIONDATA_RACE (292 of 369 remaining) [2023-08-26 00:01:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err44ASSERT_VIOLATIONDATA_RACE (291 of 369 remaining) [2023-08-26 00:01:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err45ASSERT_VIOLATIONDATA_RACE (290 of 369 remaining) [2023-08-26 00:01:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err46ASSERT_VIOLATIONDATA_RACE (289 of 369 remaining) [2023-08-26 00:01:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err47ASSERT_VIOLATIONDATA_RACE (288 of 369 remaining) [2023-08-26 00:01:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err48ASSERT_VIOLATIONDATA_RACE (287 of 369 remaining) [2023-08-26 00:01:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err49ASSERT_VIOLATIONDATA_RACE (286 of 369 remaining) [2023-08-26 00:01:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONDATA_RACE (285 of 369 remaining) [2023-08-26 00:01:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONDATA_RACE (284 of 369 remaining) [2023-08-26 00:01:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONDATA_RACE (283 of 369 remaining) [2023-08-26 00:01:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONDATA_RACE (282 of 369 remaining) [2023-08-26 00:01:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONDATA_RACE (281 of 369 remaining) [2023-08-26 00:01:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONDATA_RACE (280 of 369 remaining) [2023-08-26 00:01:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6ASSERT_VIOLATIONDATA_RACE (279 of 369 remaining) [2023-08-26 00:01:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7ASSERT_VIOLATIONDATA_RACE (278 of 369 remaining) [2023-08-26 00:01:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8ASSERT_VIOLATIONDATA_RACE (277 of 369 remaining) [2023-08-26 00:01:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9ASSERT_VIOLATIONDATA_RACE (276 of 369 remaining) [2023-08-26 00:01:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10ASSERT_VIOLATIONDATA_RACE (275 of 369 remaining) [2023-08-26 00:01:58,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11ASSERT_VIOLATIONDATA_RACE (274 of 369 remaining) [2023-08-26 00:01:58,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12ASSERT_VIOLATIONDATA_RACE (273 of 369 remaining) [2023-08-26 00:01:58,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13ASSERT_VIOLATIONDATA_RACE (272 of 369 remaining) [2023-08-26 00:01:58,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14ASSERT_VIOLATIONDATA_RACE (271 of 369 remaining) [2023-08-26 00:01:58,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15ASSERT_VIOLATIONDATA_RACE (270 of 369 remaining) [2023-08-26 00:01:58,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16ASSERT_VIOLATIONDATA_RACE (269 of 369 remaining) [2023-08-26 00:01:58,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17ASSERT_VIOLATIONDATA_RACE (268 of 369 remaining) [2023-08-26 00:01:58,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18ASSERT_VIOLATIONDATA_RACE (267 of 369 remaining) [2023-08-26 00:01:58,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19ASSERT_VIOLATIONDATA_RACE (266 of 369 remaining) [2023-08-26 00:01:58,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err20ASSERT_VIOLATIONDATA_RACE (265 of 369 remaining) [2023-08-26 00:01:58,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err21ASSERT_VIOLATIONDATA_RACE (264 of 369 remaining) [2023-08-26 00:01:58,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err22ASSERT_VIOLATIONDATA_RACE (263 of 369 remaining) [2023-08-26 00:01:58,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err23ASSERT_VIOLATIONDATA_RACE (262 of 369 remaining) [2023-08-26 00:01:58,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err24ASSERT_VIOLATIONDATA_RACE (261 of 369 remaining) [2023-08-26 00:01:58,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err25ASSERT_VIOLATIONDATA_RACE (260 of 369 remaining) [2023-08-26 00:01:58,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err26ASSERT_VIOLATIONDATA_RACE (259 of 369 remaining) [2023-08-26 00:01:58,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err27ASSERT_VIOLATIONDATA_RACE (258 of 369 remaining) [2023-08-26 00:01:58,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err28ASSERT_VIOLATIONDATA_RACE (257 of 369 remaining) [2023-08-26 00:01:58,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err29ASSERT_VIOLATIONDATA_RACE (256 of 369 remaining) [2023-08-26 00:01:58,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err30ASSERT_VIOLATIONDATA_RACE (255 of 369 remaining) [2023-08-26 00:01:58,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err31ASSERT_VIOLATIONDATA_RACE (254 of 369 remaining) [2023-08-26 00:01:58,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err32ASSERT_VIOLATIONDATA_RACE (253 of 369 remaining) [2023-08-26 00:01:58,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err33ASSERT_VIOLATIONDATA_RACE (252 of 369 remaining) [2023-08-26 00:01:58,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err34ASSERT_VIOLATIONDATA_RACE (251 of 369 remaining) [2023-08-26 00:01:58,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (250 of 369 remaining) [2023-08-26 00:01:58,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (249 of 369 remaining) [2023-08-26 00:01:58,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (248 of 369 remaining) [2023-08-26 00:01:58,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (247 of 369 remaining) [2023-08-26 00:01:58,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (246 of 369 remaining) [2023-08-26 00:01:58,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (245 of 369 remaining) [2023-08-26 00:01:58,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (244 of 369 remaining) [2023-08-26 00:01:58,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (243 of 369 remaining) [2023-08-26 00:01:58,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (242 of 369 remaining) [2023-08-26 00:01:58,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (241 of 369 remaining) [2023-08-26 00:01:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (240 of 369 remaining) [2023-08-26 00:01:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (239 of 369 remaining) [2023-08-26 00:01:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (238 of 369 remaining) [2023-08-26 00:01:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (237 of 369 remaining) [2023-08-26 00:01:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (236 of 369 remaining) [2023-08-26 00:01:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (235 of 369 remaining) [2023-08-26 00:01:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (234 of 369 remaining) [2023-08-26 00:01:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (233 of 369 remaining) [2023-08-26 00:01:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (232 of 369 remaining) [2023-08-26 00:01:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (231 of 369 remaining) [2023-08-26 00:01:58,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (230 of 369 remaining) [2023-08-26 00:01:58,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (229 of 369 remaining) [2023-08-26 00:01:58,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (228 of 369 remaining) [2023-08-26 00:01:58,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (227 of 369 remaining) [2023-08-26 00:01:58,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (226 of 369 remaining) [2023-08-26 00:01:58,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (225 of 369 remaining) [2023-08-26 00:01:58,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (224 of 369 remaining) [2023-08-26 00:01:58,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (223 of 369 remaining) [2023-08-26 00:01:58,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (222 of 369 remaining) [2023-08-26 00:01:58,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (221 of 369 remaining) [2023-08-26 00:01:58,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (220 of 369 remaining) [2023-08-26 00:01:58,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (219 of 369 remaining) [2023-08-26 00:01:58,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (218 of 369 remaining) [2023-08-26 00:01:58,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (217 of 369 remaining) [2023-08-26 00:01:58,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (216 of 369 remaining) [2023-08-26 00:01:58,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (215 of 369 remaining) [2023-08-26 00:01:58,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (214 of 369 remaining) [2023-08-26 00:01:58,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (213 of 369 remaining) [2023-08-26 00:01:58,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (212 of 369 remaining) [2023-08-26 00:01:58,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (211 of 369 remaining) [2023-08-26 00:01:58,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (210 of 369 remaining) [2023-08-26 00:01:58,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (209 of 369 remaining) [2023-08-26 00:01:58,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (208 of 369 remaining) [2023-08-26 00:01:58,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONDATA_RACE (207 of 369 remaining) [2023-08-26 00:01:58,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE (206 of 369 remaining) [2023-08-26 00:01:58,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONDATA_RACE (205 of 369 remaining) [2023-08-26 00:01:58,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONDATA_RACE (204 of 369 remaining) [2023-08-26 00:01:58,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONDATA_RACE (203 of 369 remaining) [2023-08-26 00:01:58,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONDATA_RACE (202 of 369 remaining) [2023-08-26 00:01:58,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONDATA_RACE (201 of 369 remaining) [2023-08-26 00:01:58,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONDATA_RACE (200 of 369 remaining) [2023-08-26 00:01:58,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONDATA_RACE (199 of 369 remaining) [2023-08-26 00:01:58,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONDATA_RACE (198 of 369 remaining) [2023-08-26 00:01:58,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONDATA_RACE (197 of 369 remaining) [2023-08-26 00:01:58,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONDATA_RACE (196 of 369 remaining) [2023-08-26 00:01:58,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONDATA_RACE (195 of 369 remaining) [2023-08-26 00:01:58,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONDATA_RACE (194 of 369 remaining) [2023-08-26 00:01:58,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONDATA_RACE (193 of 369 remaining) [2023-08-26 00:01:58,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONDATA_RACE (192 of 369 remaining) [2023-08-26 00:01:58,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONDATA_RACE (191 of 369 remaining) [2023-08-26 00:01:58,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONDATA_RACE (190 of 369 remaining) [2023-08-26 00:01:58,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONDATA_RACE (189 of 369 remaining) [2023-08-26 00:01:58,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONDATA_RACE (188 of 369 remaining) [2023-08-26 00:01:58,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONDATA_RACE (187 of 369 remaining) [2023-08-26 00:01:58,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONDATA_RACE (186 of 369 remaining) [2023-08-26 00:01:58,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONDATA_RACE (185 of 369 remaining) [2023-08-26 00:01:58,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONDATA_RACE (184 of 369 remaining) [2023-08-26 00:01:58,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONDATA_RACE (183 of 369 remaining) [2023-08-26 00:01:58,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONDATA_RACE (182 of 369 remaining) [2023-08-26 00:01:58,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONDATA_RACE (181 of 369 remaining) [2023-08-26 00:01:58,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONDATA_RACE (180 of 369 remaining) [2023-08-26 00:01:58,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONDATA_RACE (179 of 369 remaining) [2023-08-26 00:01:58,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONDATA_RACE (178 of 369 remaining) [2023-08-26 00:01:58,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONDATA_RACE (177 of 369 remaining) [2023-08-26 00:01:58,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONDATA_RACE (176 of 369 remaining) [2023-08-26 00:01:58,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONDATA_RACE (175 of 369 remaining) [2023-08-26 00:01:58,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONDATA_RACE (174 of 369 remaining) [2023-08-26 00:01:58,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONDATA_RACE (173 of 369 remaining) [2023-08-26 00:01:58,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONDATA_RACE (172 of 369 remaining) [2023-08-26 00:01:58,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONDATA_RACE (171 of 369 remaining) [2023-08-26 00:01:58,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONDATA_RACE (170 of 369 remaining) [2023-08-26 00:01:58,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONDATA_RACE (169 of 369 remaining) [2023-08-26 00:01:58,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONDATA_RACE (168 of 369 remaining) [2023-08-26 00:01:58,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONDATA_RACE (167 of 369 remaining) [2023-08-26 00:01:58,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONDATA_RACE (166 of 369 remaining) [2023-08-26 00:01:58,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONDATA_RACE (165 of 369 remaining) [2023-08-26 00:01:58,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONDATA_RACE (164 of 369 remaining) [2023-08-26 00:01:58,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONDATA_RACE (163 of 369 remaining) [2023-08-26 00:01:58,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONDATA_RACE (162 of 369 remaining) [2023-08-26 00:01:58,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONDATA_RACE (161 of 369 remaining) [2023-08-26 00:01:58,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONDATA_RACE (160 of 369 remaining) [2023-08-26 00:01:58,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONDATA_RACE (159 of 369 remaining) [2023-08-26 00:01:58,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONDATA_RACE (158 of 369 remaining) [2023-08-26 00:01:58,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONDATA_RACE (157 of 369 remaining) [2023-08-26 00:01:58,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONDATA_RACE (156 of 369 remaining) [2023-08-26 00:01:58,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONDATA_RACE (155 of 369 remaining) [2023-08-26 00:01:58,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONDATA_RACE (154 of 369 remaining) [2023-08-26 00:01:58,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONDATA_RACE (153 of 369 remaining) [2023-08-26 00:01:58,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONDATA_RACE (152 of 369 remaining) [2023-08-26 00:01:58,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONDATA_RACE (151 of 369 remaining) [2023-08-26 00:01:58,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONDATA_RACE (150 of 369 remaining) [2023-08-26 00:01:58,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONDATA_RACE (149 of 369 remaining) [2023-08-26 00:01:58,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONDATA_RACE (148 of 369 remaining) [2023-08-26 00:01:58,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONDATA_RACE (147 of 369 remaining) [2023-08-26 00:01:58,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONDATA_RACE (146 of 369 remaining) [2023-08-26 00:01:58,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONDATA_RACE (145 of 369 remaining) [2023-08-26 00:01:58,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONDATA_RACE (144 of 369 remaining) [2023-08-26 00:01:58,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONDATA_RACE (143 of 369 remaining) [2023-08-26 00:01:58,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONDATA_RACE (142 of 369 remaining) [2023-08-26 00:01:58,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONDATA_RACE (141 of 369 remaining) [2023-08-26 00:01:58,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONDATA_RACE (140 of 369 remaining) [2023-08-26 00:01:58,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONDATA_RACE (139 of 369 remaining) [2023-08-26 00:01:58,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONDATA_RACE (138 of 369 remaining) [2023-08-26 00:01:58,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONDATA_RACE (137 of 369 remaining) [2023-08-26 00:01:58,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONDATA_RACE (136 of 369 remaining) [2023-08-26 00:01:58,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONDATA_RACE (135 of 369 remaining) [2023-08-26 00:01:58,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONDATA_RACE (134 of 369 remaining) [2023-08-26 00:01:58,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONDATA_RACE (133 of 369 remaining) [2023-08-26 00:01:58,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONDATA_RACE (132 of 369 remaining) [2023-08-26 00:01:58,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONDATA_RACE (131 of 369 remaining) [2023-08-26 00:01:58,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONDATA_RACE (130 of 369 remaining) [2023-08-26 00:01:58,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONDATA_RACE (129 of 369 remaining) [2023-08-26 00:01:58,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONDATA_RACE (128 of 369 remaining) [2023-08-26 00:01:58,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONDATA_RACE (127 of 369 remaining) [2023-08-26 00:01:58,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONDATA_RACE (126 of 369 remaining) [2023-08-26 00:01:58,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONDATA_RACE (125 of 369 remaining) [2023-08-26 00:01:58,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONDATA_RACE (124 of 369 remaining) [2023-08-26 00:01:58,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONDATA_RACE (123 of 369 remaining) [2023-08-26 00:01:58,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONDATA_RACE (122 of 369 remaining) [2023-08-26 00:01:58,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONDATA_RACE (121 of 369 remaining) [2023-08-26 00:01:58,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONDATA_RACE (120 of 369 remaining) [2023-08-26 00:01:58,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (119 of 369 remaining) [2023-08-26 00:01:58,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (118 of 369 remaining) [2023-08-26 00:01:58,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (117 of 369 remaining) [2023-08-26 00:01:58,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONDATA_RACE (116 of 369 remaining) [2023-08-26 00:01:58,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONDATA_RACE (115 of 369 remaining) [2023-08-26 00:01:58,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONDATA_RACE (114 of 369 remaining) [2023-08-26 00:01:58,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONDATA_RACE (113 of 369 remaining) [2023-08-26 00:01:58,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONDATA_RACE (112 of 369 remaining) [2023-08-26 00:01:58,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONDATA_RACE (111 of 369 remaining) [2023-08-26 00:01:58,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6ASSERT_VIOLATIONDATA_RACE (110 of 369 remaining) [2023-08-26 00:01:58,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7ASSERT_VIOLATIONDATA_RACE (109 of 369 remaining) [2023-08-26 00:01:58,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8ASSERT_VIOLATIONDATA_RACE (108 of 369 remaining) [2023-08-26 00:01:58,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9ASSERT_VIOLATIONDATA_RACE (107 of 369 remaining) [2023-08-26 00:01:58,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10ASSERT_VIOLATIONDATA_RACE (106 of 369 remaining) [2023-08-26 00:01:58,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11ASSERT_VIOLATIONDATA_RACE (105 of 369 remaining) [2023-08-26 00:01:58,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12ASSERT_VIOLATIONDATA_RACE (104 of 369 remaining) [2023-08-26 00:01:58,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13ASSERT_VIOLATIONDATA_RACE (103 of 369 remaining) [2023-08-26 00:01:58,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14ASSERT_VIOLATIONDATA_RACE (102 of 369 remaining) [2023-08-26 00:01:58,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15ASSERT_VIOLATIONDATA_RACE (101 of 369 remaining) [2023-08-26 00:01:58,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err16ASSERT_VIOLATIONDATA_RACE (100 of 369 remaining) [2023-08-26 00:01:58,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err17ASSERT_VIOLATIONDATA_RACE (99 of 369 remaining) [2023-08-26 00:01:58,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err18ASSERT_VIOLATIONDATA_RACE (98 of 369 remaining) [2023-08-26 00:01:58,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err19ASSERT_VIOLATIONDATA_RACE (97 of 369 remaining) [2023-08-26 00:01:58,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err20ASSERT_VIOLATIONDATA_RACE (96 of 369 remaining) [2023-08-26 00:01:58,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err21ASSERT_VIOLATIONDATA_RACE (95 of 369 remaining) [2023-08-26 00:01:58,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err22ASSERT_VIOLATIONDATA_RACE (94 of 369 remaining) [2023-08-26 00:01:58,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err23ASSERT_VIOLATIONDATA_RACE (93 of 369 remaining) [2023-08-26 00:01:58,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err24ASSERT_VIOLATIONDATA_RACE (92 of 369 remaining) [2023-08-26 00:01:58,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err25ASSERT_VIOLATIONDATA_RACE (91 of 369 remaining) [2023-08-26 00:01:58,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err26ASSERT_VIOLATIONDATA_RACE (90 of 369 remaining) [2023-08-26 00:01:58,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err27ASSERT_VIOLATIONDATA_RACE (89 of 369 remaining) [2023-08-26 00:01:58,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err28ASSERT_VIOLATIONDATA_RACE (88 of 369 remaining) [2023-08-26 00:01:58,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err29ASSERT_VIOLATIONDATA_RACE (87 of 369 remaining) [2023-08-26 00:01:58,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err30ASSERT_VIOLATIONDATA_RACE (86 of 369 remaining) [2023-08-26 00:01:58,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err31ASSERT_VIOLATIONDATA_RACE (85 of 369 remaining) [2023-08-26 00:01:58,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONDATA_RACE (84 of 369 remaining) [2023-08-26 00:01:58,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONDATA_RACE (83 of 369 remaining) [2023-08-26 00:01:58,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONDATA_RACE (82 of 369 remaining) [2023-08-26 00:01:58,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONDATA_RACE (81 of 369 remaining) [2023-08-26 00:01:58,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONDATA_RACE (80 of 369 remaining) [2023-08-26 00:01:58,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONDATA_RACE (79 of 369 remaining) [2023-08-26 00:01:58,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6ASSERT_VIOLATIONDATA_RACE (78 of 369 remaining) [2023-08-26 00:01:58,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7ASSERT_VIOLATIONDATA_RACE (77 of 369 remaining) [2023-08-26 00:01:58,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8ASSERT_VIOLATIONASSERT (76 of 369 remaining) [2023-08-26 00:01:58,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9ASSERT_VIOLATIONDATA_RACE (75 of 369 remaining) [2023-08-26 00:01:58,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10ASSERT_VIOLATIONDATA_RACE (74 of 369 remaining) [2023-08-26 00:01:58,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11ASSERT_VIOLATIONDATA_RACE (73 of 369 remaining) [2023-08-26 00:01:58,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12ASSERT_VIOLATIONDATA_RACE (72 of 369 remaining) [2023-08-26 00:01:58,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13ASSERT_VIOLATIONDATA_RACE (71 of 369 remaining) [2023-08-26 00:01:58,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14ASSERT_VIOLATIONDATA_RACE (70 of 369 remaining) [2023-08-26 00:01:58,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15ASSERT_VIOLATIONDATA_RACE (69 of 369 remaining) [2023-08-26 00:01:58,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16ASSERT_VIOLATIONDATA_RACE (68 of 369 remaining) [2023-08-26 00:01:58,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17ASSERT_VIOLATIONDATA_RACE (67 of 369 remaining) [2023-08-26 00:01:58,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18ASSERT_VIOLATIONDATA_RACE (66 of 369 remaining) [2023-08-26 00:01:58,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19ASSERT_VIOLATIONDATA_RACE (65 of 369 remaining) [2023-08-26 00:01:58,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err20ASSERT_VIOLATIONDATA_RACE (64 of 369 remaining) [2023-08-26 00:01:58,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err21ASSERT_VIOLATIONDATA_RACE (63 of 369 remaining) [2023-08-26 00:01:58,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err22ASSERT_VIOLATIONDATA_RACE (62 of 369 remaining) [2023-08-26 00:01:58,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err23ASSERT_VIOLATIONDATA_RACE (61 of 369 remaining) [2023-08-26 00:01:58,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err24ASSERT_VIOLATIONDATA_RACE (60 of 369 remaining) [2023-08-26 00:01:58,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err26ASSERT_VIOLATIONDATA_RACE (59 of 369 remaining) [2023-08-26 00:01:58,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err25ASSERT_VIOLATIONDATA_RACE (58 of 369 remaining) [2023-08-26 00:01:58,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err27ASSERT_VIOLATIONDATA_RACE (57 of 369 remaining) [2023-08-26 00:01:58,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err28ASSERT_VIOLATIONDATA_RACE (56 of 369 remaining) [2023-08-26 00:01:58,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err29ASSERT_VIOLATIONDATA_RACE (55 of 369 remaining) [2023-08-26 00:01:58,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err30ASSERT_VIOLATIONDATA_RACE (54 of 369 remaining) [2023-08-26 00:01:58,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err31ASSERT_VIOLATIONDATA_RACE (53 of 369 remaining) [2023-08-26 00:01:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err32ASSERT_VIOLATIONDATA_RACE (52 of 369 remaining) [2023-08-26 00:01:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err33ASSERT_VIOLATIONDATA_RACE (51 of 369 remaining) [2023-08-26 00:01:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err34ASSERT_VIOLATIONDATA_RACE (50 of 369 remaining) [2023-08-26 00:01:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err35ASSERT_VIOLATIONDATA_RACE (49 of 369 remaining) [2023-08-26 00:01:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err36ASSERT_VIOLATIONDATA_RACE (48 of 369 remaining) [2023-08-26 00:01:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err37ASSERT_VIOLATIONDATA_RACE (47 of 369 remaining) [2023-08-26 00:01:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err38ASSERT_VIOLATIONDATA_RACE (46 of 369 remaining) [2023-08-26 00:01:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err39ASSERT_VIOLATIONDATA_RACE (45 of 369 remaining) [2023-08-26 00:01:58,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err40ASSERT_VIOLATIONDATA_RACE (44 of 369 remaining) [2023-08-26 00:01:58,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err41ASSERT_VIOLATIONDATA_RACE (43 of 369 remaining) [2023-08-26 00:01:58,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err42ASSERT_VIOLATIONDATA_RACE (42 of 369 remaining) [2023-08-26 00:01:58,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err43ASSERT_VIOLATIONDATA_RACE (41 of 369 remaining) [2023-08-26 00:01:58,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err44ASSERT_VIOLATIONDATA_RACE (40 of 369 remaining) [2023-08-26 00:01:58,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err45ASSERT_VIOLATIONDATA_RACE (39 of 369 remaining) [2023-08-26 00:01:58,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err46ASSERT_VIOLATIONDATA_RACE (38 of 369 remaining) [2023-08-26 00:01:58,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err47ASSERT_VIOLATIONDATA_RACE (37 of 369 remaining) [2023-08-26 00:01:58,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err48ASSERT_VIOLATIONDATA_RACE (36 of 369 remaining) [2023-08-26 00:01:58,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err49ASSERT_VIOLATIONDATA_RACE (35 of 369 remaining) [2023-08-26 00:01:58,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONDATA_RACE (34 of 369 remaining) [2023-08-26 00:01:58,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONDATA_RACE (33 of 369 remaining) [2023-08-26 00:01:58,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONDATA_RACE (32 of 369 remaining) [2023-08-26 00:01:58,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONDATA_RACE (31 of 369 remaining) [2023-08-26 00:01:58,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONDATA_RACE (30 of 369 remaining) [2023-08-26 00:01:58,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONDATA_RACE (29 of 369 remaining) [2023-08-26 00:01:58,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6ASSERT_VIOLATIONDATA_RACE (28 of 369 remaining) [2023-08-26 00:01:58,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7ASSERT_VIOLATIONDATA_RACE (27 of 369 remaining) [2023-08-26 00:01:58,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8ASSERT_VIOLATIONDATA_RACE (26 of 369 remaining) [2023-08-26 00:01:58,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9ASSERT_VIOLATIONDATA_RACE (25 of 369 remaining) [2023-08-26 00:01:58,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10ASSERT_VIOLATIONDATA_RACE (24 of 369 remaining) [2023-08-26 00:01:58,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11ASSERT_VIOLATIONDATA_RACE (23 of 369 remaining) [2023-08-26 00:01:58,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12ASSERT_VIOLATIONDATA_RACE (22 of 369 remaining) [2023-08-26 00:01:58,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13ASSERT_VIOLATIONDATA_RACE (21 of 369 remaining) [2023-08-26 00:01:58,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14ASSERT_VIOLATIONDATA_RACE (20 of 369 remaining) [2023-08-26 00:01:58,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15ASSERT_VIOLATIONDATA_RACE (19 of 369 remaining) [2023-08-26 00:01:58,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16ASSERT_VIOLATIONDATA_RACE (18 of 369 remaining) [2023-08-26 00:01:58,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17ASSERT_VIOLATIONDATA_RACE (17 of 369 remaining) [2023-08-26 00:01:58,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18ASSERT_VIOLATIONDATA_RACE (16 of 369 remaining) [2023-08-26 00:01:58,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19ASSERT_VIOLATIONDATA_RACE (15 of 369 remaining) [2023-08-26 00:01:58,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err20ASSERT_VIOLATIONDATA_RACE (14 of 369 remaining) [2023-08-26 00:01:58,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err21ASSERT_VIOLATIONDATA_RACE (13 of 369 remaining) [2023-08-26 00:01:58,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err22ASSERT_VIOLATIONDATA_RACE (12 of 369 remaining) [2023-08-26 00:01:58,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err23ASSERT_VIOLATIONDATA_RACE (11 of 369 remaining) [2023-08-26 00:01:58,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err24ASSERT_VIOLATIONDATA_RACE (10 of 369 remaining) [2023-08-26 00:01:58,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err25ASSERT_VIOLATIONDATA_RACE (9 of 369 remaining) [2023-08-26 00:01:58,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err26ASSERT_VIOLATIONDATA_RACE (8 of 369 remaining) [2023-08-26 00:01:58,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err27ASSERT_VIOLATIONDATA_RACE (7 of 369 remaining) [2023-08-26 00:01:58,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err28ASSERT_VIOLATIONDATA_RACE (6 of 369 remaining) [2023-08-26 00:01:58,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err29ASSERT_VIOLATIONDATA_RACE (5 of 369 remaining) [2023-08-26 00:01:58,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err30ASSERT_VIOLATIONDATA_RACE (4 of 369 remaining) [2023-08-26 00:01:58,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err31ASSERT_VIOLATIONDATA_RACE (3 of 369 remaining) [2023-08-26 00:01:58,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err32ASSERT_VIOLATIONDATA_RACE (2 of 369 remaining) [2023-08-26 00:01:58,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err33ASSERT_VIOLATIONDATA_RACE (1 of 369 remaining) [2023-08-26 00:01:58,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err34ASSERT_VIOLATIONDATA_RACE (0 of 369 remaining) [2023-08-26 00:01:58,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 00:01:58,225 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 00:01:58,237 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 00:01:58,237 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 00:01:58,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:01:58 BasicIcfg [2023-08-26 00:01:58,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 00:01:58,336 INFO L158 Benchmark]: Toolchain (without parser) took 662617.82ms. Allocated memory was 388.0MB in the beginning and 8.3GB in the end (delta: 7.9GB). Free memory was 363.3MB in the beginning and 3.0GB in the end (delta: -2.6GB). Peak memory consumption was 5.3GB. Max. memory is 16.0GB. [2023-08-26 00:01:58,336 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 388.0MB. Free memory is still 364.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 00:01:58,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.34ms. Allocated memory is still 388.0MB. Free memory was 362.8MB in the beginning and 336.5MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 00:01:58,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.94ms. Allocated memory is still 388.0MB. Free memory was 336.5MB in the beginning and 331.9MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.0GB. [2023-08-26 00:01:58,337 INFO L158 Benchmark]: Boogie Preprocessor took 76.61ms. Allocated memory is still 388.0MB. Free memory was 331.9MB in the beginning and 327.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 00:01:58,337 INFO L158 Benchmark]: RCFGBuilder took 19668.76ms. Allocated memory was 388.0MB in the beginning and 7.2GB in the end (delta: 6.8GB). Free memory was 327.1MB in the beginning and 5.3GB in the end (delta: -5.0GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-08-26 00:01:58,337 INFO L158 Benchmark]: TraceAbstraction took 642230.65ms. Allocated memory was 7.2GB in the beginning and 8.3GB in the end (delta: 1.1GB). Free memory was 5.3GB in the beginning and 3.0GB in the end (delta: 2.3GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. [2023-08-26 00:01:58,339 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.13ms. Allocated memory is still 388.0MB. Free memory is still 364.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 553.34ms. Allocated memory is still 388.0MB. Free memory was 362.8MB in the beginning and 336.5MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 81.94ms. Allocated memory is still 388.0MB. Free memory was 336.5MB in the beginning and 331.9MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.0GB. * Boogie Preprocessor took 76.61ms. Allocated memory is still 388.0MB. Free memory was 331.9MB in the beginning and 327.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 19668.76ms. Allocated memory was 388.0MB in the beginning and 7.2GB in the end (delta: 6.8GB). Free memory was 327.1MB in the beginning and 5.3GB in the end (delta: -5.0GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. * TraceAbstraction took 642230.65ms. Allocated memory was 7.2GB in the beginning and 8.3GB in the end (delta: 1.1GB). Free memory was 5.3GB in the beginning and 3.0GB in the end (delta: 2.3GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 421.2s, 369 PlacesBefore, 281 PlacesAfterwards, 362 TransitionsBefore, 271 TransitionsAfterwards, 61296 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 85 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 140 TotalNumberOfCompositions, 651364 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66223, independent: 62752, independent conditional: 0, independent unconditional: 62752, dependent: 3471, dependent conditional: 0, dependent unconditional: 3471, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 13321, independent: 13053, independent conditional: 0, independent unconditional: 13053, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 66223, independent: 49699, independent conditional: 0, independent unconditional: 49699, dependent: 3203, dependent conditional: 0, dependent unconditional: 3203, unknown: 13321, unknown conditional: 0, unknown unconditional: 13321] , Statistics on independence cache: Total cache size (in pairs): 3561, Positive cache size: 3322, Positive conditional cache size: 0, Positive unconditional cache size: 3322, Negative cache size: 239, Negative conditional cache size: 0, Negative unconditional cache size: 239, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515, ((void *)0), P0, ((void *)0))=-1, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516, ((void *)0), P1, ((void *)0))=0, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L829] 0 pthread_t t517; [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] EXPR 2 x$w_buff1_used && x$w_buff0_used [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t517, ((void *)0), P2, ((void *)0))=1, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 [L753] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 [L755] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L758] EXPR 1 __unbuffered_cnt + 1 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 [L782] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 [L784] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L787] EXPR 2 __unbuffered_cnt + 1 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 [L803] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 [L805] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 [L807] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] EXPR 3 __unbuffered_cnt + 1 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] EXPR 0 __unbuffered_cnt == 3 [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L834] 0 assume_abort_if_not(main$tmp_guard0) [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 [L836] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 [L838] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 [L839] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 [L840] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] EXPR 0 !x$w_buff0_used [L847] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used [L847] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 [L847] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L848] EXPR 0 !x$w_buff0_used [L848] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used [L848] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 [L848] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L848] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L849] EXPR 0 !x$w_buff0_used [L849] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used [L849] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 [L849] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L849] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L850] EXPR 0 !x$w_buff0_used [L850] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used [L850] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 [L850] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 !x$w_buff0_used [L851] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used [L851] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 [L851] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L852] EXPR 0 !x$w_buff0_used [L852] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used [L852] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 [L852] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !x$w_buff0_used [L853] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used [L853] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 [L853] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] EXPR 0 x == 2 [L854] EXPR 0 x == 2 && __unbuffered_p1_EAX == 0 [L854] EXPR 0 __unbuffered_p1_EAX == 0 [L854] EXPR 0 x == 2 && __unbuffered_p1_EAX == 0 [L854] EXPR 0 x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 [L854] EXPR 0 __unbuffered_p2_EAX == 1 [L854] EXPR 0 x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 [L854] EXPR 0 x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 [L854] EXPR 0 __unbuffered_p2_EBX == 0 [L854] EXPR 0 x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 [L858] 0 __VERIFIER_assert(main$tmp_guard1) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix019_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={51:52}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 745]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 754]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 754]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 754]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 754]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 755]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 755]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 755]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 755]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 755]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 755]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 774]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 800]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 800]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 804]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 804]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 804]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 804]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 807]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 807]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 807]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 807]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 807]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 807]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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: 830]: 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 7 procedures, 508 locations, 369 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: 639.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 196.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 422.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 289 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 0 mSDtfsCounter, 1061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=551occurred in iteration=0, InterpolantAutomatonStates: 55, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 1143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 00:01:58,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...