./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version efd9311c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 15:58:00,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 15:58:00,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 15:58:00,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 15:58:00,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 15:58:00,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 15:58:00,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 15:58:00,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 15:58:00,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 15:58:00,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 15:58:00,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 15:58:00,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 15:58:00,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 15:58:00,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 15:58:00,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 15:58:00,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 15:58:00,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 15:58:00,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 15:58:00,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 15:58:00,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 15:58:00,930 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 15:58:00,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 15:58:00,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 15:58:00,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 15:58:00,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 15:58:00,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 15:58:00,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 15:58:00,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 15:58:00,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 15:58:00,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 15:58:00,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 15:58:00,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 15:58:00,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 15:58:00,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 15:58:00,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 15:58:00,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 15:58:00,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 15:58:00,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 15:58:00,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 15:58:00,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 15:58:00,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 15:58:00,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 15:58:00,954 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-04-18 15:58:00,978 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 15:58:00,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 15:58:00,979 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 15:58:00,979 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 15:58:00,980 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 15:58:00,980 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 15:58:00,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 15:58:00,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 15:58:00,981 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 15:58:00,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 15:58:00,982 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 15:58:00,982 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 15:58:00,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 15:58:00,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 15:58:00,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 15:58:00,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 15:58:00,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 15:58:00,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 15:58:00,984 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 15:58:00,985 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 15:58:00,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 15:58:00,985 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 15:58:00,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 15:58:00,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 15:58:00,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 15:58:00,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 15:58:00,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 15:58:00,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 15:58:00,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 15:58:00,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 15:58:00,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 15:58:00,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 15:58:00,988 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 15:58:00,988 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-18 15:58:00,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 15:58:00,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 [2022-04-18 15:58:01,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 15:58:01,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 15:58:01,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 15:58:01,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 15:58:01,244 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 15:58:01,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-1.i [2022-04-18 15:58:01,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c9abe50d/dc215520c1d94d6986e2d2156e4e2ca1/FLAG3fcfad018 [2022-04-18 15:58:01,745 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 15:58:01,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-1.i [2022-04-18 15:58:01,763 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c9abe50d/dc215520c1d94d6986e2d2156e4e2ca1/FLAG3fcfad018 [2022-04-18 15:58:01,774 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c9abe50d/dc215520c1d94d6986e2d2156e4e2ca1 [2022-04-18 15:58:01,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 15:58:01,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 15:58:01,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 15:58:01,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 15:58:01,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 15:58:01,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:58:01" (1/1) ... [2022-04-18 15:58:01,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a0fc4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:01, skipping insertion in model container [2022-04-18 15:58:01,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:58:01" (1/1) ... [2022-04-18 15:58:01,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 15:58:01,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 15:58:02,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-1.i[30035,30048] [2022-04-18 15:58:02,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 15:58:02,160 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 15:58:02,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-1.i[30035,30048] [2022-04-18 15:58:02,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 15:58:02,226 INFO L208 MainTranslator]: Completed translation [2022-04-18 15:58:02,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:02 WrapperNode [2022-04-18 15:58:02,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 15:58:02,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 15:58:02,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 15:58:02,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 15:58:02,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:02" (1/1) ... [2022-04-18 15:58:02,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:02" (1/1) ... [2022-04-18 15:58:02,275 INFO L137 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2022-04-18 15:58:02,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 15:58:02,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 15:58:02,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 15:58:02,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 15:58:02,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:02" (1/1) ... [2022-04-18 15:58:02,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:02" (1/1) ... [2022-04-18 15:58:02,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:02" (1/1) ... [2022-04-18 15:58:02,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:02" (1/1) ... [2022-04-18 15:58:02,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:02" (1/1) ... [2022-04-18 15:58:02,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:02" (1/1) ... [2022-04-18 15:58:02,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:02" (1/1) ... [2022-04-18 15:58:02,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 15:58:02,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 15:58:02,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 15:58:02,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 15:58:02,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:02" (1/1) ... [2022-04-18 15:58:02,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 15:58:02,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 15:58:02,328 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) [2022-04-18 15:58:02,339 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 [2022-04-18 15:58:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-04-18 15:58:02,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-04-18 15:58:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-04-18 15:58:02,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-04-18 15:58:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 15:58:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-04-18 15:58:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 15:58:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 15:58:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 15:58:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 15:58:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 15:58:02,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 15:58:02,367 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 15:58:02,455 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 15:58:02,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 15:58:02,720 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 15:58:02,727 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 15:58:02,728 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-18 15:58:02,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:58:02 BoogieIcfgContainer [2022-04-18 15:58:02,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 15:58:02,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 15:58:02,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 15:58:02,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 15:58:02,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 03:58:01" (1/3) ... [2022-04-18 15:58:02,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce120af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:58:02, skipping insertion in model container [2022-04-18 15:58:02,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:02" (2/3) ... [2022-04-18 15:58:02,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce120af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:58:02, skipping insertion in model container [2022-04-18 15:58:02,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:58:02" (3/3) ... [2022-04-18 15:58:02,737 INFO L111 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-1.i [2022-04-18 15:58:02,740 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 15:58:02,740 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 15:58:02,740 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-04-18 15:58:02,740 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 15:58:02,789 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-04-18 15:58:02,826 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 15:58:02,832 INFO L340 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=true, 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 [2022-04-18 15:58:02,832 INFO L341 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-04-18 15:58:02,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 138 transitions, 286 flow [2022-04-18 15:58:02,890 INFO L129 PetriNetUnfolder]: 7/154 cut-off events. [2022-04-18 15:58:02,891 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 15:58:02,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 154 events. 7/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 188 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 101. Up to 4 conditions per place. [2022-04-18 15:58:02,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 138 transitions, 286 flow [2022-04-18 15:58:02,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 137 transitions, 282 flow [2022-04-18 15:58:02,908 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2022-04-18 15:58:02,908 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 15:58:02,909 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:58:02,909 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:02,910 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-04-18 15:58:02,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:58:02,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2090519078, now seen corresponding path program 1 times [2022-04-18 15:58:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:58:02,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510519787] [2022-04-18 15:58:02,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:58:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:58:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:58:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:58:03,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:58:03,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510519787] [2022-04-18 15:58:03,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510519787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:58:03,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:58:03,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:58:03,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080227564] [2022-04-18 15:58:03,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:58:03,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:58:03,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:58:03,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:58:03,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:58:03,184 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2022-04-18 15:58:03,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 137 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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) [2022-04-18 15:58:03,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:58:03,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2022-04-18 15:58:03,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:58:03,306 INFO L129 PetriNetUnfolder]: 26/244 cut-off events. [2022-04-18 15:58:03,307 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-04-18 15:58:03,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 244 events. 26/244 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 674 event pairs, 21 based on Foata normal form. 36/234 useless extension candidates. Maximal degree in co-relation 245. Up to 57 conditions per place. [2022-04-18 15:58:03,310 INFO L132 encePairwiseOnDemand]: 131/138 looper letters, 14 selfloop transitions, 2 changer transitions 1/131 dead transitions. [2022-04-18 15:58:03,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 131 transitions, 302 flow [2022-04-18 15:58:03,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:58:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:58:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2022-04-18 15:58:03,326 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8913043478260869 [2022-04-18 15:58:03,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2022-04-18 15:58:03,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2022-04-18 15:58:03,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:58:03,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2022-04-18 15:58:03,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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) [2022-04-18 15:58:03,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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) [2022-04-18 15:58:03,339 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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) [2022-04-18 15:58:03,340 INFO L186 Difference]: Start difference. First operand has 137 places, 137 transitions, 282 flow. Second operand 3 states and 369 transitions. [2022-04-18 15:58:03,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 131 transitions, 302 flow [2022-04-18 15:58:03,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 131 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 15:58:03,348 INFO L242 Difference]: Finished difference. Result has 136 places, 130 transitions, 271 flow [2022-04-18 15:58:03,354 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=136, PETRI_TRANSITIONS=130} [2022-04-18 15:58:03,356 INFO L335 CegarLoopForPetriNet]: 137 programPoint places, -1 predicate places. [2022-04-18 15:58:03,357 INFO L478 AbstractCegarLoop]: Abstraction has has 136 places, 130 transitions, 271 flow [2022-04-18 15:58:03,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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) [2022-04-18 15:58:03,357 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:58:03,357 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:03,357 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 15:58:03,358 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-04-18 15:58:03,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:58:03,358 INFO L85 PathProgramCache]: Analyzing trace with hash -907298788, now seen corresponding path program 1 times [2022-04-18 15:58:03,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:58:03,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743194102] [2022-04-18 15:58:03,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:58:03,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:58:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:58:03,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:58:03,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:58:03,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743194102] [2022-04-18 15:58:03,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743194102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:58:03,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:58:03,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:58:03,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608275631] [2022-04-18 15:58:03,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:58:03,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:58:03,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:58:03,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:58:03,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:58:03,428 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 138 [2022-04-18 15:58:03,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 130 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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) [2022-04-18 15:58:03,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:58:03,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 138 [2022-04-18 15:58:03,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:58:03,534 INFO L129 PetriNetUnfolder]: 110/619 cut-off events. [2022-04-18 15:58:03,534 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-04-18 15:58:03,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 619 events. 110/619 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3398 event pairs, 93 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 785. Up to 183 conditions per place. [2022-04-18 15:58:03,543 INFO L132 encePairwiseOnDemand]: 135/138 looper letters, 20 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2022-04-18 15:58:03,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 129 transitions, 313 flow [2022-04-18 15:58:03,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:58:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:58:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2022-04-18 15:58:03,546 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8526570048309179 [2022-04-18 15:58:03,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2022-04-18 15:58:03,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2022-04-18 15:58:03,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:58:03,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2022-04-18 15:58:03,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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) [2022-04-18 15:58:03,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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) [2022-04-18 15:58:03,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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) [2022-04-18 15:58:03,551 INFO L186 Difference]: Start difference. First operand has 136 places, 130 transitions, 271 flow. Second operand 3 states and 353 transitions. [2022-04-18 15:58:03,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 129 transitions, 313 flow [2022-04-18 15:58:03,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 129 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:58:03,559 INFO L242 Difference]: Finished difference. Result has 134 places, 129 transitions, 269 flow [2022-04-18 15:58:03,559 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=269, PETRI_PLACES=134, PETRI_TRANSITIONS=129} [2022-04-18 15:58:03,560 INFO L335 CegarLoopForPetriNet]: 137 programPoint places, -3 predicate places. [2022-04-18 15:58:03,560 INFO L478 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 269 flow [2022-04-18 15:58:03,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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) [2022-04-18 15:58:03,561 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:58:03,561 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:03,562 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 15:58:03,562 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-04-18 15:58:03,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:58:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash -10396590, now seen corresponding path program 1 times [2022-04-18 15:58:03,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:58:03,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330117077] [2022-04-18 15:58:03,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:58:03,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:58:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:58:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:58:03,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:58:03,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330117077] [2022-04-18 15:58:03,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330117077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:58:03,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:58:03,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:58:03,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872165698] [2022-04-18 15:58:03,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:58:03,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:58:03,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:58:03,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:58:03,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:58:03,671 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-04-18 15:58:03,672 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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) [2022-04-18 15:58:03,672 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:58:03,672 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-04-18 15:58:03,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:58:03,750 INFO L129 PetriNetUnfolder]: 44/420 cut-off events. [2022-04-18 15:58:03,751 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-04-18 15:58:03,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 420 events. 44/420 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1910 event pairs, 34 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 469. Up to 74 conditions per place. [2022-04-18 15:58:03,754 INFO L132 encePairwiseOnDemand]: 132/138 looper letters, 13 selfloop transitions, 1 changer transitions 0/124 dead transitions. [2022-04-18 15:58:03,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 287 flow [2022-04-18 15:58:03,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:58:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:58:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2022-04-18 15:58:03,756 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8647342995169082 [2022-04-18 15:58:03,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2022-04-18 15:58:03,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2022-04-18 15:58:03,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:58:03,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2022-04-18 15:58:03,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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) [2022-04-18 15:58:03,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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) [2022-04-18 15:58:03,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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) [2022-04-18 15:58:03,762 INFO L186 Difference]: Start difference. First operand has 134 places, 129 transitions, 269 flow. Second operand 3 states and 358 transitions. [2022-04-18 15:58:03,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 287 flow [2022-04-18 15:58:03,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 124 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:58:03,766 INFO L242 Difference]: Finished difference. Result has 129 places, 124 transitions, 257 flow [2022-04-18 15:58:03,766 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=129, PETRI_TRANSITIONS=124} [2022-04-18 15:58:03,768 INFO L335 CegarLoopForPetriNet]: 137 programPoint places, -8 predicate places. [2022-04-18 15:58:03,768 INFO L478 AbstractCegarLoop]: Abstraction has has 129 places, 124 transitions, 257 flow [2022-04-18 15:58:03,769 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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) [2022-04-18 15:58:03,769 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:58:03,769 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:03,769 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 15:58:03,770 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-04-18 15:58:03,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:58:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash -10200230, now seen corresponding path program 1 times [2022-04-18 15:58:03,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:58:03,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502123310] [2022-04-18 15:58:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:58:03,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:58:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:58:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:58:03,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:58:03,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502123310] [2022-04-18 15:58:03,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502123310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:58:03,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:58:03,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:58:03,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787935286] [2022-04-18 15:58:03,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:58:03,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:58:03,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:58:03,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:58:03,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:58:03,878 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 138 [2022-04-18 15:58:03,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 124 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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) [2022-04-18 15:58:03,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:58:03,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 138 [2022-04-18 15:58:03,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:58:03,932 INFO L129 PetriNetUnfolder]: 16/249 cut-off events. [2022-04-18 15:58:03,933 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-04-18 15:58:03,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 249 events. 16/249 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 640 event pairs, 4 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 265. Up to 29 conditions per place. [2022-04-18 15:58:03,936 INFO L132 encePairwiseOnDemand]: 132/138 looper letters, 14 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2022-04-18 15:58:03,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 129 transitions, 306 flow [2022-04-18 15:58:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:58:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:58:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2022-04-18 15:58:03,939 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9106280193236715 [2022-04-18 15:58:03,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2022-04-18 15:58:03,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2022-04-18 15:58:03,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:58:03,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2022-04-18 15:58:03,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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) [2022-04-18 15:58:03,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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) [2022-04-18 15:58:03,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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) [2022-04-18 15:58:03,946 INFO L186 Difference]: Start difference. First operand has 129 places, 124 transitions, 257 flow. Second operand 3 states and 377 transitions. [2022-04-18 15:58:03,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 129 transitions, 306 flow [2022-04-18 15:58:03,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 129 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 15:58:03,951 INFO L242 Difference]: Finished difference. Result has 131 places, 126 transitions, 284 flow [2022-04-18 15:58:03,952 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=131, PETRI_TRANSITIONS=126} [2022-04-18 15:58:03,953 INFO L335 CegarLoopForPetriNet]: 137 programPoint places, -6 predicate places. [2022-04-18 15:58:03,953 INFO L478 AbstractCegarLoop]: Abstraction has has 131 places, 126 transitions, 284 flow [2022-04-18 15:58:03,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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) [2022-04-18 15:58:03,958 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:58:03,959 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:03,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 15:58:03,960 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-04-18 15:58:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:58:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1135106733, now seen corresponding path program 1 times [2022-04-18 15:58:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:58:03,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762859304] [2022-04-18 15:58:03,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:58:03,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:58:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:58:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-18 15:58:04,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:58:04,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762859304] [2022-04-18 15:58:04,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762859304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:58:04,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:58:04,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 15:58:04,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5204661] [2022-04-18 15:58:04,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:58:04,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 15:58:04,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:58:04,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 15:58:04,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-18 15:58:04,105 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 138 [2022-04-18 15:58:04,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 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) [2022-04-18 15:58:04,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:58:04,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 138 [2022-04-18 15:58:04,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:58:04,164 INFO L129 PetriNetUnfolder]: 3/193 cut-off events. [2022-04-18 15:58:04,164 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-04-18 15:58:04,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 193 events. 3/193 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 348 event pairs, 1 based on Foata normal form. 1/180 useless extension candidates. Maximal degree in co-relation 195. Up to 12 conditions per place. [2022-04-18 15:58:04,165 INFO L132 encePairwiseOnDemand]: 134/138 looper letters, 11 selfloop transitions, 0 changer transitions 4/129 dead transitions. [2022-04-18 15:58:04,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 129 transitions, 320 flow [2022-04-18 15:58:04,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 15:58:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-04-18 15:58:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2022-04-18 15:58:04,173 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8927536231884058 [2022-04-18 15:58:04,173 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2022-04-18 15:58:04,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2022-04-18 15:58:04,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:58:04,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2022-04-18 15:58:04,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 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) [2022-04-18 15:58:04,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 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) [2022-04-18 15:58:04,178 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 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) [2022-04-18 15:58:04,178 INFO L186 Difference]: Start difference. First operand has 131 places, 126 transitions, 284 flow. Second operand 5 states and 616 transitions. [2022-04-18 15:58:04,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 129 transitions, 320 flow [2022-04-18 15:58:04,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 129 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:58:04,182 INFO L242 Difference]: Finished difference. Result has 136 places, 125 transitions, 280 flow [2022-04-18 15:58:04,182 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=136, PETRI_TRANSITIONS=125} [2022-04-18 15:58:04,184 INFO L335 CegarLoopForPetriNet]: 137 programPoint places, -1 predicate places. [2022-04-18 15:58:04,185 INFO L478 AbstractCegarLoop]: Abstraction has has 136 places, 125 transitions, 280 flow [2022-04-18 15:58:04,185 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 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) [2022-04-18 15:58:04,185 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:58:04,185 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:04,186 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 15:58:04,186 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-04-18 15:58:04,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:58:04,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1692640194, now seen corresponding path program 1 times [2022-04-18 15:58:04,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:58:04,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285556934] [2022-04-18 15:58:04,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:58:04,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:58:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:58:04,224 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 15:58:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:58:04,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 15:58:04,286 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 15:58:04,287 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2022-04-18 15:58:04,289 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2022-04-18 15:58:04,289 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2022-04-18 15:58:04,290 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2022-04-18 15:58:04,290 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2022-04-18 15:58:04,291 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2022-04-18 15:58:04,291 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2022-04-18 15:58:04,291 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2022-04-18 15:58:04,291 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2022-04-18 15:58:04,291 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2022-04-18 15:58:04,291 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2022-04-18 15:58:04,292 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 17 remaining) [2022-04-18 15:58:04,292 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2022-04-18 15:58:04,292 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2022-04-18 15:58:04,295 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2022-04-18 15:58:04,296 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2022-04-18 15:58:04,296 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2022-04-18 15:58:04,296 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 15:58:04,299 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-18 15:58:04,300 WARN L232 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-04-18 15:58:04,300 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-04-18 15:58:04,356 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-04-18 15:58:04,358 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 15:58:04,360 INFO L340 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=true, 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 [2022-04-18 15:58:04,360 INFO L341 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-04-18 15:58:04,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 189 places, 188 transitions, 400 flow [2022-04-18 15:58:04,395 INFO L129 PetriNetUnfolder]: 10/208 cut-off events. [2022-04-18 15:58:04,395 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-04-18 15:58:04,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 208 events. 10/208 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 361 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 217. Up to 6 conditions per place. [2022-04-18 15:58:04,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 188 transitions, 400 flow [2022-04-18 15:58:04,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 169 transitions, 353 flow [2022-04-18 15:58:04,406 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2022-04-18 15:58:04,406 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 15:58:04,407 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:58:04,407 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:04,407 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-04-18 15:58:04,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:58:04,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1825814106, now seen corresponding path program 1 times [2022-04-18 15:58:04,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:58:04,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927189845] [2022-04-18 15:58:04,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:58:04,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:58:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:58:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:58:04,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:58:04,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927189845] [2022-04-18 15:58:04,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927189845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:58:04,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:58:04,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:58:04,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888980832] [2022-04-18 15:58:04,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:58:04,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:58:04,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:58:04,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:58:04,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:58:04,451 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 188 [2022-04-18 15:58:04,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 169 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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) [2022-04-18 15:58:04,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:58:04,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 188 [2022-04-18 15:58:04,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:58:04,646 INFO L129 PetriNetUnfolder]: 377/1347 cut-off events. [2022-04-18 15:58:04,646 INFO L130 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-04-18 15:58:04,654 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 1347 events. 377/1347 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9003 event pairs, 336 based on Foata normal form. 307/1321 useless extension candidates. Maximal degree in co-relation 1952. Up to 568 conditions per place. [2022-04-18 15:58:04,666 INFO L132 encePairwiseOnDemand]: 180/188 looper letters, 21 selfloop transitions, 2 changer transitions 1/162 dead transitions. [2022-04-18 15:58:04,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 385 flow [2022-04-18 15:58:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:58:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:58:04,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-04-18 15:58:04,668 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8599290780141844 [2022-04-18 15:58:04,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2022-04-18 15:58:04,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2022-04-18 15:58:04,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:58:04,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2022-04-18 15:58:04,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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) [2022-04-18 15:58:04,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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) [2022-04-18 15:58:04,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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) [2022-04-18 15:58:04,672 INFO L186 Difference]: Start difference. First operand has 169 places, 169 transitions, 353 flow. Second operand 3 states and 485 transitions. [2022-04-18 15:58:04,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 385 flow [2022-04-18 15:58:04,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 382 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-04-18 15:58:04,676 INFO L242 Difference]: Finished difference. Result has 168 places, 161 transitions, 338 flow [2022-04-18 15:58:04,676 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=168, PETRI_TRANSITIONS=161} [2022-04-18 15:58:04,677 INFO L335 CegarLoopForPetriNet]: 169 programPoint places, -1 predicate places. [2022-04-18 15:58:04,678 INFO L478 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 338 flow [2022-04-18 15:58:04,678 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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) [2022-04-18 15:58:04,678 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:58:04,678 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:04,678 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 15:58:04,678 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-04-18 15:58:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:58:04,679 INFO L85 PathProgramCache]: Analyzing trace with hash -424994472, now seen corresponding path program 1 times [2022-04-18 15:58:04,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:58:04,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057731207] [2022-04-18 15:58:04,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:58:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:58:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:58:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:58:04,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:58:04,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057731207] [2022-04-18 15:58:04,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057731207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:58:04,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:58:04,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:58:04,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756399857] [2022-04-18 15:58:04,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:58:04,713 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:58:04,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:58:04,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:58:04,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:58:04,716 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 188 [2022-04-18 15:58:04,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 161 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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) [2022-04-18 15:58:04,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:58:04,717 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 188 [2022-04-18 15:58:04,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:58:05,028 INFO L129 PetriNetUnfolder]: 734/2801 cut-off events. [2022-04-18 15:58:05,029 INFO L130 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-04-18 15:58:05,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3850 conditions, 2801 events. 734/2801 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 23290 event pairs, 621 based on Foata normal form. 0/2119 useless extension candidates. Maximal degree in co-relation 3811. Up to 967 conditions per place. [2022-04-18 15:58:05,057 INFO L132 encePairwiseOnDemand]: 185/188 looper letters, 24 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2022-04-18 15:58:05,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 160 transitions, 388 flow [2022-04-18 15:58:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:58:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:58:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2022-04-18 15:58:05,059 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8404255319148937 [2022-04-18 15:58:05,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 474 transitions. [2022-04-18 15:58:05,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 474 transitions. [2022-04-18 15:58:05,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:58:05,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 474 transitions. [2022-04-18 15:58:05,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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) [2022-04-18 15:58:05,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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) [2022-04-18 15:58:05,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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) [2022-04-18 15:58:05,064 INFO L186 Difference]: Start difference. First operand has 168 places, 161 transitions, 338 flow. Second operand 3 states and 474 transitions. [2022-04-18 15:58:05,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 160 transitions, 388 flow [2022-04-18 15:58:05,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:58:05,067 INFO L242 Difference]: Finished difference. Result has 166 places, 160 transitions, 336 flow [2022-04-18 15:58:05,068 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2022-04-18 15:58:05,068 INFO L335 CegarLoopForPetriNet]: 169 programPoint places, -3 predicate places. [2022-04-18 15:58:05,068 INFO L478 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 336 flow [2022-04-18 15:58:05,069 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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) [2022-04-18 15:58:05,069 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:58:05,069 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:05,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 15:58:05,069 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-04-18 15:58:05,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:58:05,069 INFO L85 PathProgramCache]: Analyzing trace with hash -13758834, now seen corresponding path program 1 times [2022-04-18 15:58:05,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:58:05,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604552960] [2022-04-18 15:58:05,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:58:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:58:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:58:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:58:05,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:58:05,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604552960] [2022-04-18 15:58:05,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604552960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:58:05,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:58:05,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:58:05,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983243272] [2022-04-18 15:58:05,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:58:05,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:58:05,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:58:05,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:58:05,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:58:05,111 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 188 [2022-04-18 15:58:05,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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) [2022-04-18 15:58:05,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:58:05,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 188 [2022-04-18 15:58:05,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:58:05,304 INFO L129 PetriNetUnfolder]: 233/1396 cut-off events. [2022-04-18 15:58:05,304 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-04-18 15:58:05,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 1396 events. 233/1396 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10066 event pairs, 178 based on Foata normal form. 0/1209 useless extension candidates. Maximal degree in co-relation 1705. Up to 299 conditions per place. [2022-04-18 15:58:05,318 INFO L132 encePairwiseOnDemand]: 181/188 looper letters, 16 selfloop transitions, 1 changer transitions 0/154 dead transitions. [2022-04-18 15:58:05,319 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 358 flow [2022-04-18 15:58:05,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:58:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:58:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-04-18 15:58:05,321 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.849290780141844 [2022-04-18 15:58:05,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2022-04-18 15:58:05,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2022-04-18 15:58:05,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:58:05,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2022-04-18 15:58:05,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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) [2022-04-18 15:58:05,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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) [2022-04-18 15:58:05,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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) [2022-04-18 15:58:05,324 INFO L186 Difference]: Start difference. First operand has 166 places, 160 transitions, 336 flow. Second operand 3 states and 479 transitions. [2022-04-18 15:58:05,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 154 transitions, 358 flow [2022-04-18 15:58:05,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 154 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:58:05,328 INFO L242 Difference]: Finished difference. Result has 160 places, 154 transitions, 322 flow [2022-04-18 15:58:05,329 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2022-04-18 15:58:05,330 INFO L335 CegarLoopForPetriNet]: 169 programPoint places, -9 predicate places. [2022-04-18 15:58:05,330 INFO L478 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 322 flow [2022-04-18 15:58:05,331 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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) [2022-04-18 15:58:05,331 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:58:05,331 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:05,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 15:58:05,332 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-04-18 15:58:05,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:58:05,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1264049558, now seen corresponding path program 1 times [2022-04-18 15:58:05,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:58:05,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776882469] [2022-04-18 15:58:05,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:58:05,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:58:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:58:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:58:05,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:58:05,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776882469] [2022-04-18 15:58:05,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776882469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:58:05,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:58:05,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:58:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501063585] [2022-04-18 15:58:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:58:05,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:58:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:58:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:58:05,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:58:05,387 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 188 [2022-04-18 15:58:05,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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) [2022-04-18 15:58:05,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:58:05,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 188 [2022-04-18 15:58:05,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:58:05,627 INFO L129 PetriNetUnfolder]: 350/1791 cut-off events. [2022-04-18 15:58:05,627 INFO L130 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-04-18 15:58:05,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2523 conditions, 1791 events. 350/1791 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 13599 event pairs, 121 based on Foata normal form. 0/1517 useless extension candidates. Maximal degree in co-relation 2477. Up to 364 conditions per place. [2022-04-18 15:58:05,646 INFO L132 encePairwiseOnDemand]: 177/188 looper letters, 26 selfloop transitions, 8 changer transitions 0/168 dead transitions. [2022-04-18 15:58:05,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 426 flow [2022-04-18 15:58:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:58:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:58:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-04-18 15:58:05,648 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8900709219858156 [2022-04-18 15:58:05,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2022-04-18 15:58:05,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2022-04-18 15:58:05,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:58:05,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2022-04-18 15:58:05,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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) [2022-04-18 15:58:05,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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) [2022-04-18 15:58:05,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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) [2022-04-18 15:58:05,652 INFO L186 Difference]: Start difference. First operand has 160 places, 154 transitions, 322 flow. Second operand 3 states and 502 transitions. [2022-04-18 15:58:05,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 168 transitions, 426 flow [2022-04-18 15:58:05,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 168 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 15:58:05,656 INFO L242 Difference]: Finished difference. Result has 163 places, 162 transitions, 391 flow [2022-04-18 15:58:05,656 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=163, PETRI_TRANSITIONS=162} [2022-04-18 15:58:05,657 INFO L335 CegarLoopForPetriNet]: 169 programPoint places, -6 predicate places. [2022-04-18 15:58:05,657 INFO L478 AbstractCegarLoop]: Abstraction has has 163 places, 162 transitions, 391 flow [2022-04-18 15:58:05,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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) [2022-04-18 15:58:05,658 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:58:05,658 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:05,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 15:58:05,659 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-04-18 15:58:05,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:58:05,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2096221313, now seen corresponding path program 1 times [2022-04-18 15:58:05,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:58:05,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085070324] [2022-04-18 15:58:05,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:58:05,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:58:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:58:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:58:05,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:58:05,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085070324] [2022-04-18 15:58:05,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085070324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:58:05,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:58:05,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:58:05,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634514052] [2022-04-18 15:58:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:58:05,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:58:05,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:58:05,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:58:05,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:58:05,700 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 188 [2022-04-18 15:58:05,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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) [2022-04-18 15:58:05,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:58:05,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 188 [2022-04-18 15:58:05,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:58:06,000 INFO L129 PetriNetUnfolder]: 526/1995 cut-off events. [2022-04-18 15:58:06,000 INFO L130 PetriNetUnfolder]: For 701/836 co-relation queries the response was YES. [2022-04-18 15:58:06,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3727 conditions, 1995 events. 526/1995 cut-off events. For 701/836 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 15260 event pairs, 205 based on Foata normal form. 3/1779 useless extension candidates. Maximal degree in co-relation 3680. Up to 702 conditions per place. [2022-04-18 15:58:06,029 INFO L132 encePairwiseOnDemand]: 181/188 looper letters, 37 selfloop transitions, 10 changer transitions 0/179 dead transitions. [2022-04-18 15:58:06,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 179 transitions, 558 flow [2022-04-18 15:58:06,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:58:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:58:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2022-04-18 15:58:06,032 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2022-04-18 15:58:06,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2022-04-18 15:58:06,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2022-04-18 15:58:06,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:58:06,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2022-04-18 15:58:06,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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) [2022-04-18 15:58:06,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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) [2022-04-18 15:58:06,036 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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) [2022-04-18 15:58:06,036 INFO L186 Difference]: Start difference. First operand has 163 places, 162 transitions, 391 flow. Second operand 3 states and 494 transitions. [2022-04-18 15:58:06,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 179 transitions, 558 flow [2022-04-18 15:58:06,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 179 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:58:06,043 INFO L242 Difference]: Finished difference. Result has 165 places, 170 transitions, 461 flow [2022-04-18 15:58:06,043 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=165, PETRI_TRANSITIONS=170} [2022-04-18 15:58:06,044 INFO L335 CegarLoopForPetriNet]: 169 programPoint places, -4 predicate places. [2022-04-18 15:58:06,044 INFO L478 AbstractCegarLoop]: Abstraction has has 165 places, 170 transitions, 461 flow [2022-04-18 15:58:06,045 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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) [2022-04-18 15:58:06,045 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:58:06,045 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:06,045 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-18 15:58:06,045 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-04-18 15:58:06,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:58:06,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1978733824, now seen corresponding path program 1 times [2022-04-18 15:58:06,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:58:06,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927626162] [2022-04-18 15:58:06,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:58:06,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:58:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:58:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:58:06,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:58:06,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927626162] [2022-04-18 15:58:06,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927626162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:58:06,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:58:06,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 15:58:06,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461142329] [2022-04-18 15:58:06,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:58:06,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 15:58:06,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:58:06,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 15:58:06,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-18 15:58:06,117 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2022-04-18 15:58:06,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 170 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 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) [2022-04-18 15:58:06,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:58:06,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2022-04-18 15:58:06,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:58:06,271 INFO L129 PetriNetUnfolder]: 150/1061 cut-off events. [2022-04-18 15:58:06,271 INFO L130 PetriNetUnfolder]: For 233/454 co-relation queries the response was YES. [2022-04-18 15:58:06,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 1061 events. 150/1061 cut-off events. For 233/454 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7450 event pairs, 36 based on Foata normal form. 1/925 useless extension candidates. Maximal degree in co-relation 1606. Up to 170 conditions per place. [2022-04-18 15:58:06,284 INFO L132 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 0 changer transitions 4/173 dead transitions. [2022-04-18 15:58:06,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 173 transitions, 499 flow [2022-04-18 15:58:06,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 15:58:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-04-18 15:58:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 842 transitions. [2022-04-18 15:58:06,288 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8957446808510638 [2022-04-18 15:58:06,288 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 842 transitions. [2022-04-18 15:58:06,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 842 transitions. [2022-04-18 15:58:06,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:58:06,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 842 transitions. [2022-04-18 15:58:06,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.4) internal successors, (842), 5 states have internal predecessors, (842), 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) [2022-04-18 15:58:06,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 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) [2022-04-18 15:58:06,293 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 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) [2022-04-18 15:58:06,293 INFO L186 Difference]: Start difference. First operand has 165 places, 170 transitions, 461 flow. Second operand 5 states and 842 transitions. [2022-04-18 15:58:06,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 173 transitions, 499 flow [2022-04-18 15:58:06,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 173 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:58:06,298 INFO L242 Difference]: Finished difference. Result has 170 places, 169 transitions, 445 flow [2022-04-18 15:58:06,299 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=170, PETRI_TRANSITIONS=169} [2022-04-18 15:58:06,299 INFO L335 CegarLoopForPetriNet]: 169 programPoint places, 1 predicate places. [2022-04-18 15:58:06,299 INFO L478 AbstractCegarLoop]: Abstraction has has 170 places, 169 transitions, 445 flow [2022-04-18 15:58:06,300 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 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) [2022-04-18 15:58:06,300 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:58:06,300 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:06,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 15:58:06,301 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-04-18 15:58:06,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:58:06,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1181173309, now seen corresponding path program 1 times [2022-04-18 15:58:06,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:58:06,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620889204] [2022-04-18 15:58:06,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:58:06,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:58:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:58:06,322 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 15:58:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:58:06,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 15:58:06,350 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 15:58:06,351 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2022-04-18 15:58:06,351 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2022-04-18 15:58:06,351 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2022-04-18 15:58:06,351 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2022-04-18 15:58:06,352 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2022-04-18 15:58:06,352 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2022-04-18 15:58:06,352 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2022-04-18 15:58:06,352 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2022-04-18 15:58:06,352 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2022-04-18 15:58:06,353 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2022-04-18 15:58:06,353 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2022-04-18 15:58:06,353 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2022-04-18 15:58:06,353 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 22 remaining) [2022-04-18 15:58:06,353 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2022-04-18 15:58:06,353 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2022-04-18 15:58:06,354 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2022-04-18 15:58:06,354 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2022-04-18 15:58:06,354 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2022-04-18 15:58:06,354 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2022-04-18 15:58:06,354 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2022-04-18 15:58:06,355 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2022-04-18 15:58:06,355 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2022-04-18 15:58:06,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 15:58:06,355 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:58:06,360 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-04-18 15:58:06,360 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 15:58:06,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 03:58:06 BasicIcfg [2022-04-18 15:58:06,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 15:58:06,483 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 15:58:06,483 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 15:58:06,483 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 15:58:06,484 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:58:02" (3/4) ... [2022-04-18 15:58:06,486 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-04-18 15:58:06,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 15:58:06,487 INFO L158 Benchmark]: Toolchain (without parser) took 4709.45ms. Allocated memory was 96.5MB in the beginning and 314.6MB in the end (delta: 218.1MB). Free memory was 63.6MB in the beginning and 229.3MB in the end (delta: -165.7MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2022-04-18 15:58:06,488 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 15:58:06,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.19ms. Allocated memory is still 96.5MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-04-18 15:58:06,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.27ms. Allocated memory is still 96.5MB. Free memory was 61.2MB in the beginning and 58.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 15:58:06,489 INFO L158 Benchmark]: Boogie Preprocessor took 20.98ms. Allocated memory is still 96.5MB. Free memory was 58.9MB in the beginning and 57.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 15:58:06,491 INFO L158 Benchmark]: RCFGBuilder took 431.47ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 57.6MB in the beginning and 90.8MB in the end (delta: -33.1MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2022-04-18 15:58:06,491 INFO L158 Benchmark]: TraceAbstraction took 3751.58ms. Allocated memory was 117.4MB in the beginning and 314.6MB in the end (delta: 197.1MB). Free memory was 90.8MB in the beginning and 229.3MB in the end (delta: -138.5MB). Peak memory consumption was 182.1MB. Max. memory is 16.1GB. [2022-04-18 15:58:06,491 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 314.6MB. Free memory is still 229.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 15:58:06,493 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.19ms. Allocated memory is still 96.5MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.27ms. Allocated memory is still 96.5MB. Free memory was 61.2MB in the beginning and 58.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.98ms. Allocated memory is still 96.5MB. Free memory was 58.9MB in the beginning and 57.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.47ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 57.6MB in the beginning and 90.8MB in the end (delta: -33.1MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3751.58ms. Allocated memory was 117.4MB in the beginning and 314.6MB in the end (delta: 197.1MB). Free memory was 90.8MB in the beginning and 229.3MB in the end (delta: -138.5MB). Peak memory consumption was 182.1MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 314.6MB. Free memory is still 229.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 694]: Data race detected Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L692] 0 pthread_mutex_t mut = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mut={3:0}, n=0, x=0] [L708] 0 pthread_t t1, t2; VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=0, t1={6:0}, t2={5:0}, x=0] [L709] 0 x = 0 VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=0, t1={6:0}, t2={5:0}, x=0] [L710] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=54, __VERIFIER_nondet_uint()=10, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=10, n = __VERIFIER_nondet_uint()=51, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n >= (10/2) VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n >= (10/2) && n <= 10 VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=10, n >= (10/2) && n <= 10=1, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n <= 10 VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=10, n >= (10/2) && n <= 10=1, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n >= (10/2) && n <= 10 VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=10, n >= (10/2) && n <= 10=1, t1={6:0}, t2={5:0}, x=0] [L711] CALL 0 assume_abort_if_not(n >= (10/2) && n <= 10) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=10, x=0] [L711] RET 0 assume_abort_if_not(n >= (10/2) && n <= 10) [L712] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, mut={3:0}, n=10, pthread_create(&t1, 0, thr1, 0)=13, t1={6:0}, t2={5:0}, x=0] [L694] 1 x < n VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=10, x=0] [L713] 0 int i = 0; VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, i=0, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L713] 0 i < n VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, i=0, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L713] COND TRUE 0 i < n VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, i=0, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L714] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(argc)=54, argc=54, argv={53:52}, argv={53:52}, i=0, mut={3:0}, n=10, pthread_create(&t2, 0, thr2, 0)=14, t1={6:0}, t2={5:0}, x=0] [L697] 2 int t; VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=10, x=0] [L698] 2 int k = __VERIFIER_nondet_uint(); VAL [__VERIFIER_nondet_uint()=10, arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, x=0] [L699] CALL 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L687] COND FALSE 2 !(!cond) VAL [\old(cond)=1, \old(cond)=1, cond=1, cond=1, mut={3:0}, n=10, x=0] [L699] RET 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L701] 2 t = x VAL [arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L702] 2 k == n VAL [arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L702] COND TRUE 2 k == n VAL [arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L703] 2 x = t + 1 VAL [arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=1, x = t + 1=50] [L694] 1 x < n VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=10, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [703] and C: x < n [694] - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: 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: 712]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 181 locations, 17 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: 1.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 57 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=284occurred in iteration=4, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 7/7 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 228 locations, 22 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: 2.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 149 IncrementalHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 93 mSDtfsCounter, 149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 418 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 could not prove your program: unable to determine feasibility of some traces [2022-04-18 15:58:06,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE