./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c --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/weaver/popl20-three-array-sum.wvr.c -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 4b8273370cd4ec5730806cf9b8f54c915e93daab6c48b9546d3920e402afdc55 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 16:36:28,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 16:36:28,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 16:36:28,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 16:36:28,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 16:36:28,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 16:36:28,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 16:36:28,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 16:36:28,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 16:36:28,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 16:36:28,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 16:36:28,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 16:36:28,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 16:36:28,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 16:36:28,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 16:36:28,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 16:36:28,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 16:36:28,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 16:36:28,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 16:36:28,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 16:36:28,423 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 16:36:28,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 16:36:28,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 16:36:28,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 16:36:28,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 16:36:28,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 16:36:28,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 16:36:28,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 16:36:28,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 16:36:28,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 16:36:28,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 16:36:28,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 16:36:28,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 16:36:28,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 16:36:28,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 16:36:28,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 16:36:28,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 16:36:28,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 16:36:28,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 16:36:28,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 16:36:28,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 16:36:28,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 16:36:28,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-04-18 16:36:28,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 16:36:28,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 16:36:28,471 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 16:36:28,471 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 16:36:28,472 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 16:36:28,472 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 16:36:28,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 16:36:28,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 16:36:28,473 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 16:36:28,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 16:36:28,474 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 16:36:28,474 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 16:36:28,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 16:36:28,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 16:36:28,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 16:36:28,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 16:36:28,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 16:36:28,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 16:36:28,476 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 16:36:28,477 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 16:36:28,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 16:36:28,477 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 16:36:28,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 16:36:28,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 16:36:28,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 16:36:28,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 16:36:28,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 16:36:28,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 16:36:28,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 16:36:28,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 16:36:28,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 16:36:28,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 16:36:28,479 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 16:36:28,479 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-18 16:36:28,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 16:36:28,480 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 -> 4b8273370cd4ec5730806cf9b8f54c915e93daab6c48b9546d3920e402afdc55 [2022-04-18 16:36:28,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 16:36:28,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 16:36:28,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 16:36:28,745 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 16:36:28,746 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 16:36:28,747 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2022-04-18 16:36:28,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2198b4bf5/cc243ea8bcbd412a94269c27c815c482/FLAG9d8698c53 [2022-04-18 16:36:29,233 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 16:36:29,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2022-04-18 16:36:29,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2198b4bf5/cc243ea8bcbd412a94269c27c815c482/FLAG9d8698c53 [2022-04-18 16:36:29,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2198b4bf5/cc243ea8bcbd412a94269c27c815c482 [2022-04-18 16:36:29,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 16:36:29,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 16:36:29,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 16:36:29,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 16:36:29,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 16:36:29,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 04:36:29" (1/1) ... [2022-04-18 16:36:29,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f15a36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:29, skipping insertion in model container [2022-04-18 16:36:29,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 04:36:29" (1/1) ... [2022-04-18 16:36:29,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 16:36:29,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 16:36:29,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2022-04-18 16:36:29,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 16:36:29,906 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 16:36:29,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2022-04-18 16:36:29,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 16:36:29,949 INFO L208 MainTranslator]: Completed translation [2022-04-18 16:36:29,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:29 WrapperNode [2022-04-18 16:36:29,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 16:36:29,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 16:36:29,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 16:36:29,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 16:36:29,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:29" (1/1) ... [2022-04-18 16:36:29,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:29" (1/1) ... [2022-04-18 16:36:30,008 INFO L137 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 214 [2022-04-18 16:36:30,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 16:36:30,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 16:36:30,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 16:36:30,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 16:36:30,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:29" (1/1) ... [2022-04-18 16:36:30,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:29" (1/1) ... [2022-04-18 16:36:30,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:29" (1/1) ... [2022-04-18 16:36:30,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:29" (1/1) ... [2022-04-18 16:36:30,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:29" (1/1) ... [2022-04-18 16:36:30,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:29" (1/1) ... [2022-04-18 16:36:30,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:29" (1/1) ... [2022-04-18 16:36:30,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 16:36:30,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 16:36:30,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 16:36:30,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 16:36:30,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:29" (1/1) ... [2022-04-18 16:36:30,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 16:36:30,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 16:36:30,117 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 16:36:30,132 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 16:36:30,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 16:36:30,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 16:36:30,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 16:36:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 16:36:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-04-18 16:36:30,162 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-04-18 16:36:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-04-18 16:36:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-04-18 16:36:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-04-18 16:36:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-04-18 16:36:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 16:36:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-04-18 16:36:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-04-18 16:36:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-18 16:36:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 16:36:30,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 16:36:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 16:36:30,166 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 16:36:30,303 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 16:36:30,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 16:36:30,815 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 16:36:30,942 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 16:36:30,943 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-18 16:36:30,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:36:30 BoogieIcfgContainer [2022-04-18 16:36:30,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 16:36:30,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 16:36:30,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 16:36:30,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 16:36:30,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 04:36:29" (1/3) ... [2022-04-18 16:36:30,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61240374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 04:36:30, skipping insertion in model container [2022-04-18 16:36:30,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:29" (2/3) ... [2022-04-18 16:36:30,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61240374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 04:36:30, skipping insertion in model container [2022-04-18 16:36:30,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:36:30" (3/3) ... [2022-04-18 16:36:30,955 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2022-04-18 16:36:30,960 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 16:36:30,960 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 16:36:30,961 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-04-18 16:36:30,961 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 16:36:31,047 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-04-18 16:36:31,106 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 16:36:31,114 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 16:36:31,115 INFO L341 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-04-18 16:36:31,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 352 places, 362 transitions, 748 flow [2022-04-18 16:36:31,295 INFO L129 PetriNetUnfolder]: 20/359 cut-off events. [2022-04-18 16:36:31,295 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-04-18 16:36:31,303 INFO L84 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 359 events. 20/359 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 442 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 284. Up to 3 conditions per place. [2022-04-18 16:36:31,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 352 places, 362 transitions, 748 flow [2022-04-18 16:36:31,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 339 transitions, 696 flow [2022-04-18 16:36:31,320 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2022-04-18 16:36:31,320 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 16:36:31,321 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:31,321 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] [2022-04-18 16:36:31,323 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:31,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:31,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1303378583, now seen corresponding path program 1 times [2022-04-18 16:36:31,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:31,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004996581] [2022-04-18 16:36:31,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:31,530 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 16:36:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:31,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004996581] [2022-04-18 16:36:31,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004996581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:31,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:31,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:31,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20776654] [2022-04-18 16:36:31,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:31,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:31,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:31,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:31,575 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 362 [2022-04-18 16:36:31,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 339 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 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 16:36:31,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:31,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 362 [2022-04-18 16:36:31,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:32,033 INFO L129 PetriNetUnfolder]: 380/1345 cut-off events. [2022-04-18 16:36:32,034 INFO L130 PetriNetUnfolder]: For 140/293 co-relation queries the response was YES. [2022-04-18 16:36:32,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 1345 events. 380/1345 cut-off events. For 140/293 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7925 event pairs, 255 based on Foata normal form. 9/1051 useless extension candidates. Maximal degree in co-relation 1630. Up to 542 conditions per place. [2022-04-18 16:36:32,056 INFO L132 encePairwiseOnDemand]: 335/362 looper letters, 30 selfloop transitions, 2 changer transitions 6/314 dead transitions. [2022-04-18 16:36:32,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 314 transitions, 710 flow [2022-04-18 16:36:32,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2022-04-18 16:36:32,077 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8895027624309392 [2022-04-18 16:36:32,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 966 transitions. [2022-04-18 16:36:32,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 966 transitions. [2022-04-18 16:36:32,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:32,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 966 transitions. [2022-04-18 16:36:32,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.0) internal successors, (966), 3 states have internal predecessors, (966), 0 states have call successors, (0), 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 16:36:32,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:32,103 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:32,105 INFO L186 Difference]: Start difference. First operand has 330 places, 339 transitions, 696 flow. Second operand 3 states and 966 transitions. [2022-04-18 16:36:32,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 314 transitions, 710 flow [2022-04-18 16:36:32,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 314 transitions, 698 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-04-18 16:36:32,125 INFO L242 Difference]: Finished difference. Result has 313 places, 308 transitions, 626 flow [2022-04-18 16:36:32,128 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=313, PETRI_TRANSITIONS=308} [2022-04-18 16:36:32,131 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, -17 predicate places. [2022-04-18 16:36:32,132 INFO L478 AbstractCegarLoop]: Abstraction has has 313 places, 308 transitions, 626 flow [2022-04-18 16:36:32,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 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 16:36:32,133 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:32,133 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] [2022-04-18 16:36:32,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 16:36:32,134 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:32,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:32,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1481128444, now seen corresponding path program 1 times [2022-04-18 16:36:32,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:32,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183168110] [2022-04-18 16:36:32,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:32,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:32,218 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 16:36:32,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:32,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183168110] [2022-04-18 16:36:32,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183168110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:32,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:32,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190194179] [2022-04-18 16:36:32,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:32,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:32,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:32,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:32,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:32,232 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 362 [2022-04-18 16:36:32,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 308 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 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 16:36:32,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:32,234 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 362 [2022-04-18 16:36:32,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:32,441 INFO L129 PetriNetUnfolder]: 213/996 cut-off events. [2022-04-18 16:36:32,442 INFO L130 PetriNetUnfolder]: For 27/107 co-relation queries the response was YES. [2022-04-18 16:36:32,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 996 events. 213/996 cut-off events. For 27/107 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5272 event pairs, 128 based on Foata normal form. 0/846 useless extension candidates. Maximal degree in co-relation 1279. Up to 297 conditions per place. [2022-04-18 16:36:32,454 INFO L132 encePairwiseOnDemand]: 355/362 looper letters, 22 selfloop transitions, 1 changer transitions 0/302 dead transitions. [2022-04-18 16:36:32,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 302 transitions, 660 flow [2022-04-18 16:36:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 947 transitions. [2022-04-18 16:36:32,457 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8720073664825047 [2022-04-18 16:36:32,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 947 transitions. [2022-04-18 16:36:32,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 947 transitions. [2022-04-18 16:36:32,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:32,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 947 transitions. [2022-04-18 16:36:32,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 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 16:36:32,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:32,464 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:32,464 INFO L186 Difference]: Start difference. First operand has 313 places, 308 transitions, 626 flow. Second operand 3 states and 947 transitions. [2022-04-18 16:36:32,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 302 transitions, 660 flow [2022-04-18 16:36:32,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 302 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:32,473 INFO L242 Difference]: Finished difference. Result has 301 places, 302 transitions, 612 flow [2022-04-18 16:36:32,474 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=301, PETRI_TRANSITIONS=302} [2022-04-18 16:36:32,475 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, -29 predicate places. [2022-04-18 16:36:32,475 INFO L478 AbstractCegarLoop]: Abstraction has has 301 places, 302 transitions, 612 flow [2022-04-18 16:36:32,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 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 16:36:32,476 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:32,476 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] [2022-04-18 16:36:32,477 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 16:36:32,477 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:32,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:32,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1973439662, now seen corresponding path program 1 times [2022-04-18 16:36:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:32,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731825863] [2022-04-18 16:36:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:32,591 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 16:36:32,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:32,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731825863] [2022-04-18 16:36:32,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731825863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:32,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:32,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:32,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533936711] [2022-04-18 16:36:32,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:32,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:32,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:32,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:32,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:32,596 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-04-18 16:36:32,597 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 302 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 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 16:36:32,597 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:32,597 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-04-18 16:36:32,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:32,758 INFO L129 PetriNetUnfolder]: 94/832 cut-off events. [2022-04-18 16:36:32,759 INFO L130 PetriNetUnfolder]: For 20/23 co-relation queries the response was YES. [2022-04-18 16:36:32,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 832 events. 94/832 cut-off events. For 20/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4099 event pairs, 45 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 945. Up to 131 conditions per place. [2022-04-18 16:36:32,768 INFO L132 encePairwiseOnDemand]: 359/362 looper letters, 15 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2022-04-18 16:36:32,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 301 transitions, 644 flow [2022-04-18 16:36:32,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2022-04-18 16:36:32,772 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8950276243093923 [2022-04-18 16:36:32,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2022-04-18 16:36:32,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2022-04-18 16:36:32,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:32,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2022-04-18 16:36:32,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 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 16:36:32,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:32,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:32,781 INFO L186 Difference]: Start difference. First operand has 301 places, 302 transitions, 612 flow. Second operand 3 states and 972 transitions. [2022-04-18 16:36:32,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 301 transitions, 644 flow [2022-04-18 16:36:32,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 301 transitions, 643 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:36:32,800 INFO L242 Difference]: Finished difference. Result has 301 places, 301 transitions, 613 flow [2022-04-18 16:36:32,801 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=301, PETRI_TRANSITIONS=301} [2022-04-18 16:36:32,803 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, -29 predicate places. [2022-04-18 16:36:32,803 INFO L478 AbstractCegarLoop]: Abstraction has has 301 places, 301 transitions, 613 flow [2022-04-18 16:36:32,804 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 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 16:36:32,804 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:32,804 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] [2022-04-18 16:36:32,804 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 16:36:32,805 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:32,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:32,805 INFO L85 PathProgramCache]: Analyzing trace with hash 245285443, now seen corresponding path program 1 times [2022-04-18 16:36:32,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:32,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812867264] [2022-04-18 16:36:32,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:32,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:32,981 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 16:36:32,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:32,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812867264] [2022-04-18 16:36:32,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812867264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:32,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:32,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:32,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043935785] [2022-04-18 16:36:32,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:32,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:32,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:32,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:32,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:32,986 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 362 [2022-04-18 16:36:32,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 301 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 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 16:36:32,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:32,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 362 [2022-04-18 16:36:32,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:33,837 INFO L129 PetriNetUnfolder]: 1533/3699 cut-off events. [2022-04-18 16:36:33,837 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-04-18 16:36:33,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5965 conditions, 3699 events. 1533/3699 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 25648 event pairs, 1176 based on Foata normal form. 0/3182 useless extension candidates. Maximal degree in co-relation 5930. Up to 2206 conditions per place. [2022-04-18 16:36:33,881 INFO L132 encePairwiseOnDemand]: 344/362 looper letters, 72 selfloop transitions, 15 changer transitions 0/298 dead transitions. [2022-04-18 16:36:33,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 298 transitions, 781 flow [2022-04-18 16:36:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1566 transitions. [2022-04-18 16:36:33,889 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7209944751381215 [2022-04-18 16:36:33,889 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1566 transitions. [2022-04-18 16:36:33,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1566 transitions. [2022-04-18 16:36:33,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:33,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1566 transitions. [2022-04-18 16:36:33,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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 16:36:33,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 16:36:33,899 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 16:36:33,900 INFO L186 Difference]: Start difference. First operand has 301 places, 301 transitions, 613 flow. Second operand 6 states and 1566 transitions. [2022-04-18 16:36:33,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 298 transitions, 781 flow [2022-04-18 16:36:33,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 298 transitions, 777 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:33,907 INFO L242 Difference]: Finished difference. Result has 301 places, 298 transitions, 633 flow [2022-04-18 16:36:33,908 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=633, PETRI_PLACES=301, PETRI_TRANSITIONS=298} [2022-04-18 16:36:33,909 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, -29 predicate places. [2022-04-18 16:36:33,909 INFO L478 AbstractCegarLoop]: Abstraction has has 301 places, 298 transitions, 633 flow [2022-04-18 16:36:33,912 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 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 16:36:33,912 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:33,913 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, 1, 1, 1, 1, 1] [2022-04-18 16:36:33,913 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 16:36:33,913 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash 928307443, now seen corresponding path program 1 times [2022-04-18 16:36:33,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:33,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8686430] [2022-04-18 16:36:33,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:33,978 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 16:36:33,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:33,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8686430] [2022-04-18 16:36:33,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8686430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:33,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:33,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810173257] [2022-04-18 16:36:33,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:33,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:33,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:33,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:33,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:33,983 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-04-18 16:36:34,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 298 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 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 16:36:34,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:34,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-04-18 16:36:34,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:34,189 INFO L129 PetriNetUnfolder]: 94/912 cut-off events. [2022-04-18 16:36:34,190 INFO L130 PetriNetUnfolder]: For 20/23 co-relation queries the response was YES. [2022-04-18 16:36:34,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 912 events. 94/912 cut-off events. For 20/23 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4364 event pairs, 45 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 1040. Up to 131 conditions per place. [2022-04-18 16:36:34,198 INFO L132 encePairwiseOnDemand]: 359/362 looper letters, 15 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2022-04-18 16:36:34,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 297 transitions, 665 flow [2022-04-18 16:36:34,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2022-04-18 16:36:34,201 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8950276243093923 [2022-04-18 16:36:34,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2022-04-18 16:36:34,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2022-04-18 16:36:34,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:34,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2022-04-18 16:36:34,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 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 16:36:34,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:34,208 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:34,208 INFO L186 Difference]: Start difference. First operand has 301 places, 298 transitions, 633 flow. Second operand 3 states and 972 transitions. [2022-04-18 16:36:34,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 297 transitions, 665 flow [2022-04-18 16:36:34,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 297 transitions, 635 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-04-18 16:36:34,214 INFO L242 Difference]: Finished difference. Result has 297 places, 297 transitions, 605 flow [2022-04-18 16:36:34,214 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=297, PETRI_TRANSITIONS=297} [2022-04-18 16:36:34,215 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, -33 predicate places. [2022-04-18 16:36:34,215 INFO L478 AbstractCegarLoop]: Abstraction has has 297 places, 297 transitions, 605 flow [2022-04-18 16:36:34,216 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 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 16:36:34,216 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:34,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:34,216 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 16:36:34,217 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:34,217 INFO L85 PathProgramCache]: Analyzing trace with hash -986290866, now seen corresponding path program 1 times [2022-04-18 16:36:34,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:34,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975338526] [2022-04-18 16:36:34,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:34,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:34,268 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 16:36:34,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:34,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975338526] [2022-04-18 16:36:34,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975338526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:34,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:34,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928264976] [2022-04-18 16:36:34,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:34,270 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:34,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:34,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:34,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:34,273 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 362 [2022-04-18 16:36:34,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 297 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 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 16:36:34,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:34,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 362 [2022-04-18 16:36:34,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:34,396 INFO L129 PetriNetUnfolder]: 35/400 cut-off events. [2022-04-18 16:36:34,396 INFO L130 PetriNetUnfolder]: For 14/17 co-relation queries the response was YES. [2022-04-18 16:36:34,398 INFO L84 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 400 events. 35/400 cut-off events. For 14/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 955 event pairs, 12 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 423. Up to 48 conditions per place. [2022-04-18 16:36:34,400 INFO L132 encePairwiseOnDemand]: 359/362 looper letters, 12 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2022-04-18 16:36:34,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 296 transitions, 631 flow [2022-04-18 16:36:34,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 978 transitions. [2022-04-18 16:36:34,403 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9005524861878453 [2022-04-18 16:36:34,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 978 transitions. [2022-04-18 16:36:34,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 978 transitions. [2022-04-18 16:36:34,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:34,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 978 transitions. [2022-04-18 16:36:34,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 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 16:36:34,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:34,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:34,410 INFO L186 Difference]: Start difference. First operand has 297 places, 297 transitions, 605 flow. Second operand 3 states and 978 transitions. [2022-04-18 16:36:34,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 296 transitions, 631 flow [2022-04-18 16:36:34,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 296 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:34,436 INFO L242 Difference]: Finished difference. Result has 296 places, 296 transitions, 603 flow [2022-04-18 16:36:34,437 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=296, PETRI_TRANSITIONS=296} [2022-04-18 16:36:34,437 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, -34 predicate places. [2022-04-18 16:36:34,437 INFO L478 AbstractCegarLoop]: Abstraction has has 296 places, 296 transitions, 603 flow [2022-04-18 16:36:34,438 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 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 16:36:34,438 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:34,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:34,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 16:36:34,439 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:34,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash -390066838, now seen corresponding path program 1 times [2022-04-18 16:36:34,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:34,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421719564] [2022-04-18 16:36:34,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:34,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:34,495 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 16:36:34,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:34,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421719564] [2022-04-18 16:36:34,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421719564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:34,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:34,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:34,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822083969] [2022-04-18 16:36:34,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:34,497 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:34,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:34,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:34,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:34,500 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-04-18 16:36:34,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 296 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 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 16:36:34,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:34,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-04-18 16:36:34,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:34,677 INFO L129 PetriNetUnfolder]: 119/893 cut-off events. [2022-04-18 16:36:34,678 INFO L130 PetriNetUnfolder]: For 20/25 co-relation queries the response was YES. [2022-04-18 16:36:34,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 893 events. 119/893 cut-off events. For 20/25 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4466 event pairs, 45 based on Foata normal form. 1/782 useless extension candidates. Maximal degree in co-relation 1058. Up to 120 conditions per place. [2022-04-18 16:36:34,686 INFO L132 encePairwiseOnDemand]: 357/362 looper letters, 18 selfloop transitions, 3 changer transitions 0/299 dead transitions. [2022-04-18 16:36:34,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 299 transitions, 653 flow [2022-04-18 16:36:34,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2022-04-18 16:36:34,689 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8996316758747698 [2022-04-18 16:36:34,689 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 977 transitions. [2022-04-18 16:36:34,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 977 transitions. [2022-04-18 16:36:34,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:34,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 977 transitions. [2022-04-18 16:36:34,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 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 16:36:34,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:34,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:34,694 INFO L186 Difference]: Start difference. First operand has 296 places, 296 transitions, 603 flow. Second operand 3 states and 977 transitions. [2022-04-18 16:36:34,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 299 transitions, 653 flow [2022-04-18 16:36:34,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 299 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:34,700 INFO L242 Difference]: Finished difference. Result has 294 places, 294 transitions, 601 flow [2022-04-18 16:36:34,701 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=294, PETRI_TRANSITIONS=294} [2022-04-18 16:36:34,701 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, -36 predicate places. [2022-04-18 16:36:34,702 INFO L478 AbstractCegarLoop]: Abstraction has has 294 places, 294 transitions, 601 flow [2022-04-18 16:36:34,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 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 16:36:34,702 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:34,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:34,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 16:36:34,703 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:34,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:34,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1192045716, now seen corresponding path program 1 times [2022-04-18 16:36:34,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:34,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554489838] [2022-04-18 16:36:34,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:34,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:34,779 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 16:36:34,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:34,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554489838] [2022-04-18 16:36:34,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554489838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:34,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:34,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:34,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615146817] [2022-04-18 16:36:34,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:34,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:34,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:34,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:34,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:34,784 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 362 [2022-04-18 16:36:34,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 294 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 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 16:36:34,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:34,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 362 [2022-04-18 16:36:34,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:34,962 INFO L129 PetriNetUnfolder]: 84/837 cut-off events. [2022-04-18 16:36:34,963 INFO L130 PetriNetUnfolder]: For 25/30 co-relation queries the response was YES. [2022-04-18 16:36:34,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 837 events. 84/837 cut-off events. For 25/30 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3986 event pairs, 8 based on Foata normal form. 1/748 useless extension candidates. Maximal degree in co-relation 954. Up to 102 conditions per place. [2022-04-18 16:36:34,971 INFO L132 encePairwiseOnDemand]: 359/362 looper letters, 20 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2022-04-18 16:36:34,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 302 transitions, 666 flow [2022-04-18 16:36:34,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 986 transitions. [2022-04-18 16:36:34,975 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9079189686924494 [2022-04-18 16:36:34,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 986 transitions. [2022-04-18 16:36:34,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 986 transitions. [2022-04-18 16:36:34,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:34,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 986 transitions. [2022-04-18 16:36:34,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.6666666666667) internal successors, (986), 3 states have internal predecessors, (986), 0 states have call successors, (0), 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 16:36:34,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:34,981 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:34,981 INFO L186 Difference]: Start difference. First operand has 294 places, 294 transitions, 601 flow. Second operand 3 states and 986 transitions. [2022-04-18 16:36:34,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 302 transitions, 666 flow [2022-04-18 16:36:34,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 302 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:34,987 INFO L242 Difference]: Finished difference. Result has 294 places, 295 transitions, 607 flow [2022-04-18 16:36:34,988 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=294, PETRI_TRANSITIONS=295} [2022-04-18 16:36:34,990 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, -36 predicate places. [2022-04-18 16:36:34,991 INFO L478 AbstractCegarLoop]: Abstraction has has 294 places, 295 transitions, 607 flow [2022-04-18 16:36:34,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 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 16:36:34,993 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:34,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:34,993 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 16:36:34,994 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:34,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:34,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2023219472, now seen corresponding path program 1 times [2022-04-18 16:36:34,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:34,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033143732] [2022-04-18 16:36:34,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:34,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:35,088 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 16:36:35,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:35,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033143732] [2022-04-18 16:36:35,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033143732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:35,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:35,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-18 16:36:35,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526869892] [2022-04-18 16:36:35,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:35,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 16:36:35,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:35,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 16:36:35,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-18 16:36:35,093 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 362 [2022-04-18 16:36:35,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 295 transitions, 607 flow. Second operand has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 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 16:36:35,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:35,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 362 [2022-04-18 16:36:35,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:36,364 INFO L129 PetriNetUnfolder]: 2045/5891 cut-off events. [2022-04-18 16:36:36,365 INFO L130 PetriNetUnfolder]: For 328/415 co-relation queries the response was YES. [2022-04-18 16:36:36,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9416 conditions, 5891 events. 2045/5891 cut-off events. For 328/415 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 45825 event pairs, 968 based on Foata normal form. 2/4770 useless extension candidates. Maximal degree in co-relation 9379. Up to 2066 conditions per place. [2022-04-18 16:36:36,426 INFO L132 encePairwiseOnDemand]: 343/362 looper letters, 196 selfloop transitions, 28 changer transitions 0/433 dead transitions. [2022-04-18 16:36:36,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 433 transitions, 1367 flow [2022-04-18 16:36:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 16:36:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-04-18 16:36:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2949 transitions. [2022-04-18 16:36:36,434 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7405826217980914 [2022-04-18 16:36:36,435 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2949 transitions. [2022-04-18 16:36:36,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2949 transitions. [2022-04-18 16:36:36,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:36,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2949 transitions. [2022-04-18 16:36:36,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 268.09090909090907) internal successors, (2949), 11 states have internal predecessors, (2949), 0 states have call successors, (0), 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 16:36:36,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 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 16:36:36,455 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 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 16:36:36,455 INFO L186 Difference]: Start difference. First operand has 294 places, 295 transitions, 607 flow. Second operand 11 states and 2949 transitions. [2022-04-18 16:36:36,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 433 transitions, 1367 flow [2022-04-18 16:36:36,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 433 transitions, 1367 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 16:36:36,464 INFO L242 Difference]: Finished difference. Result has 308 places, 312 transitions, 740 flow [2022-04-18 16:36:36,465 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=740, PETRI_PLACES=308, PETRI_TRANSITIONS=312} [2022-04-18 16:36:36,466 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, -22 predicate places. [2022-04-18 16:36:36,466 INFO L478 AbstractCegarLoop]: Abstraction has has 308 places, 312 transitions, 740 flow [2022-04-18 16:36:36,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 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 16:36:36,467 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:36,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:36,468 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 16:36:36,468 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:36,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:36,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1104760021, now seen corresponding path program 1 times [2022-04-18 16:36:36,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:36,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51232380] [2022-04-18 16:36:36,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:36,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:36,569 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 16:36:36,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:36,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51232380] [2022-04-18 16:36:36,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51232380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:36,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:36,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:36,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746636041] [2022-04-18 16:36:36,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:36,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:36,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:36,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:36,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:36,575 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 362 [2022-04-18 16:36:36,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 312 transitions, 740 flow. Second operand has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 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 16:36:36,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:36,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 362 [2022-04-18 16:36:36,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:38,338 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 8#L97-6true, 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 131#thread3ENTRYtrue, 47#L50-3true, 225#L62true, 417#true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-04-18 16:36:38,339 INFO L384 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-04-18 16:36:38,339 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-04-18 16:36:38,339 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-04-18 16:36:38,339 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-04-18 16:36:38,433 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][236], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L50-3true, 274#L97-1true, 225#L62true, 417#true, 48#L73true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-04-18 16:36:38,433 INFO L384 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-04-18 16:36:38,434 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-04-18 16:36:38,434 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-04-18 16:36:38,434 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-04-18 16:36:38,434 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][259], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L50-3true, 225#L62true, 417#true, 74#L97-3true, 48#L73true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-04-18 16:36:38,434 INFO L384 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-04-18 16:36:38,435 INFO L387 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-04-18 16:36:38,435 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-04-18 16:36:38,435 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-04-18 16:36:38,435 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][260], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L50-3true, 91#L97-4true, 225#L62true, 417#true, 48#L73true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-04-18 16:36:38,435 INFO L384 tUnfolder$Statistics]: this new event has 245 ancestors and is cut-off event [2022-04-18 16:36:38,436 INFO L387 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-04-18 16:36:38,436 INFO L387 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-04-18 16:36:38,436 INFO L387 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-04-18 16:36:38,436 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][261], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L50-3true, 225#L62true, 417#true, 156#L97-2true, 48#L73true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-04-18 16:36:38,436 INFO L384 tUnfolder$Statistics]: this new event has 243 ancestors and is cut-off event [2022-04-18 16:36:38,436 INFO L387 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-04-18 16:36:38,437 INFO L387 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-04-18 16:36:38,437 INFO L387 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-04-18 16:36:38,437 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 8#L97-6true, 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L50-3true, 225#L62true, 417#true, 48#L73true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-04-18 16:36:38,437 INFO L384 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-04-18 16:36:38,437 INFO L387 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-04-18 16:36:38,438 INFO L387 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-04-18 16:36:38,438 INFO L387 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-04-18 16:36:38,438 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 37#L97-5true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L50-3true, 225#L62true, 417#true, 48#L73true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-04-18 16:36:38,438 INFO L384 tUnfolder$Statistics]: this new event has 246 ancestors and is cut-off event [2022-04-18 16:36:38,438 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-04-18 16:36:38,438 INFO L387 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-04-18 16:36:38,439 INFO L387 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-04-18 16:36:38,450 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][236], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 274#L97-1true, 286#L77true, 47#L50-3true, 225#L62true, 417#true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-04-18 16:36:38,450 INFO L384 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-04-18 16:36:38,450 INFO L387 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-04-18 16:36:38,451 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-04-18 16:36:38,451 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-04-18 16:36:38,451 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][259], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 286#L77true, 47#L50-3true, 225#L62true, 417#true, 74#L97-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-04-18 16:36:38,451 INFO L384 tUnfolder$Statistics]: this new event has 246 ancestors and is cut-off event [2022-04-18 16:36:38,451 INFO L387 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-04-18 16:36:38,451 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-04-18 16:36:38,452 INFO L387 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-04-18 16:36:38,452 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][260], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 286#L77true, 47#L50-3true, 91#L97-4true, 225#L62true, 417#true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-04-18 16:36:38,452 INFO L384 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-04-18 16:36:38,452 INFO L387 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-04-18 16:36:38,452 INFO L387 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-04-18 16:36:38,453 INFO L387 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-04-18 16:36:38,453 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][261], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 286#L77true, 47#L50-3true, 225#L62true, 417#true, 156#L97-2true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-04-18 16:36:38,453 INFO L384 tUnfolder$Statistics]: this new event has 245 ancestors and is cut-off event [2022-04-18 16:36:38,453 INFO L387 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-04-18 16:36:38,453 INFO L387 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-04-18 16:36:38,454 INFO L387 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-04-18 16:36:38,454 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 37#L97-5true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 286#L77true, 47#L50-3true, 417#true, 225#L62true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-04-18 16:36:38,454 INFO L384 tUnfolder$Statistics]: this new event has 248 ancestors and is cut-off event [2022-04-18 16:36:38,454 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-04-18 16:36:38,454 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-04-18 16:36:38,454 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-04-18 16:36:38,455 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 8#L97-6true, 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 286#L77true, 47#L50-3true, 225#L62true, 417#true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-04-18 16:36:38,455 INFO L384 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-04-18 16:36:38,455 INFO L387 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-04-18 16:36:38,455 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-04-18 16:36:38,455 INFO L387 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-04-18 16:36:38,488 INFO L129 PetriNetUnfolder]: 2849/6962 cut-off events. [2022-04-18 16:36:38,488 INFO L130 PetriNetUnfolder]: For 1321/1351 co-relation queries the response was YES. [2022-04-18 16:36:38,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12807 conditions, 6962 events. 2849/6962 cut-off events. For 1321/1351 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 52508 event pairs, 653 based on Foata normal form. 24/6379 useless extension candidates. Maximal degree in co-relation 12763. Up to 2574 conditions per place. [2022-04-18 16:36:38,558 INFO L132 encePairwiseOnDemand]: 355/362 looper letters, 129 selfloop transitions, 13 changer transitions 0/395 dead transitions. [2022-04-18 16:36:38,559 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 395 transitions, 1213 flow [2022-04-18 16:36:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1776 transitions. [2022-04-18 16:36:38,563 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8176795580110497 [2022-04-18 16:36:38,563 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1776 transitions. [2022-04-18 16:36:38,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1776 transitions. [2022-04-18 16:36:38,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:38,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1776 transitions. [2022-04-18 16:36:38,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 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 16:36:38,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 16:36:38,573 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 16:36:38,573 INFO L186 Difference]: Start difference. First operand has 308 places, 312 transitions, 740 flow. Second operand 6 states and 1776 transitions. [2022-04-18 16:36:38,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 395 transitions, 1213 flow [2022-04-18 16:36:38,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 395 transitions, 1208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:38,583 INFO L242 Difference]: Finished difference. Result has 316 places, 324 transitions, 845 flow [2022-04-18 16:36:38,583 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=845, PETRI_PLACES=316, PETRI_TRANSITIONS=324} [2022-04-18 16:36:38,584 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, -14 predicate places. [2022-04-18 16:36:38,584 INFO L478 AbstractCegarLoop]: Abstraction has has 316 places, 324 transitions, 845 flow [2022-04-18 16:36:38,585 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 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 16:36:38,585 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:38,585 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:38,585 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 16:36:38,586 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:38,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:38,586 INFO L85 PathProgramCache]: Analyzing trace with hash 708268253, now seen corresponding path program 1 times [2022-04-18 16:36:38,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:38,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117291926] [2022-04-18 16:36:38,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:38,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:38,707 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 16:36:38,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:38,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117291926] [2022-04-18 16:36:38,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117291926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:38,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:38,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-18 16:36:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030724906] [2022-04-18 16:36:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:38,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 16:36:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 16:36:38,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-18 16:36:38,711 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 362 [2022-04-18 16:36:38,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 324 transitions, 845 flow. Second operand has 7 states, 7 states have (on average 266.57142857142856) internal successors, (1866), 7 states have internal predecessors, (1866), 0 states have call successors, (0), 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 16:36:38,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:38,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 362 [2022-04-18 16:36:38,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:40,010 INFO L129 PetriNetUnfolder]: 2331/5562 cut-off events. [2022-04-18 16:36:40,010 INFO L130 PetriNetUnfolder]: For 2756/3468 co-relation queries the response was YES. [2022-04-18 16:36:40,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10994 conditions, 5562 events. 2331/5562 cut-off events. For 2756/3468 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40815 event pairs, 1130 based on Foata normal form. 37/4477 useless extension candidates. Maximal degree in co-relation 10948. Up to 2836 conditions per place. [2022-04-18 16:36:40,095 INFO L132 encePairwiseOnDemand]: 343/362 looper letters, 178 selfloop transitions, 28 changer transitions 0/435 dead transitions. [2022-04-18 16:36:40,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 435 transitions, 1511 flow [2022-04-18 16:36:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 16:36:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-04-18 16:36:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3081 transitions. [2022-04-18 16:36:40,104 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7737317930688097 [2022-04-18 16:36:40,104 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3081 transitions. [2022-04-18 16:36:40,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3081 transitions. [2022-04-18 16:36:40,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:40,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3081 transitions. [2022-04-18 16:36:40,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 280.09090909090907) internal successors, (3081), 11 states have internal predecessors, (3081), 0 states have call successors, (0), 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 16:36:40,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 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 16:36:40,120 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 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 16:36:40,121 INFO L186 Difference]: Start difference. First operand has 316 places, 324 transitions, 845 flow. Second operand 11 states and 3081 transitions. [2022-04-18 16:36:40,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 435 transitions, 1511 flow [2022-04-18 16:36:40,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 435 transitions, 1511 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 16:36:40,137 INFO L242 Difference]: Finished difference. Result has 328 places, 326 transitions, 913 flow [2022-04-18 16:36:40,137 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=913, PETRI_PLACES=328, PETRI_TRANSITIONS=326} [2022-04-18 16:36:40,138 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, -2 predicate places. [2022-04-18 16:36:40,138 INFO L478 AbstractCegarLoop]: Abstraction has has 328 places, 326 transitions, 913 flow [2022-04-18 16:36:40,139 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 266.57142857142856) internal successors, (1866), 7 states have internal predecessors, (1866), 0 states have call successors, (0), 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 16:36:40,139 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:40,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:40,140 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-18 16:36:40,140 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:40,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:40,140 INFO L85 PathProgramCache]: Analyzing trace with hash 707516207, now seen corresponding path program 1 times [2022-04-18 16:36:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:40,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690572874] [2022-04-18 16:36:40,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:40,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:40,273 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 16:36:40,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:40,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690572874] [2022-04-18 16:36:40,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690572874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:40,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:40,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:40,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073130761] [2022-04-18 16:36:40,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:40,275 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:40,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:40,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:40,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:40,277 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 362 [2022-04-18 16:36:40,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 326 transitions, 913 flow. Second operand has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 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 16:36:40,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:40,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 362 [2022-04-18 16:36:40,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:41,634 INFO L129 PetriNetUnfolder]: 2259/7129 cut-off events. [2022-04-18 16:36:41,634 INFO L130 PetriNetUnfolder]: For 5284/5389 co-relation queries the response was YES. [2022-04-18 16:36:41,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14516 conditions, 7129 events. 2259/7129 cut-off events. For 5284/5389 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 63326 event pairs, 1240 based on Foata normal form. 12/6634 useless extension candidates. Maximal degree in co-relation 14465. Up to 3011 conditions per place. [2022-04-18 16:36:41,719 INFO L132 encePairwiseOnDemand]: 355/362 looper letters, 86 selfloop transitions, 17 changer transitions 0/358 dead transitions. [2022-04-18 16:36:41,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 358 transitions, 1253 flow [2022-04-18 16:36:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1721 transitions. [2022-04-18 16:36:41,724 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7923572744014733 [2022-04-18 16:36:41,724 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1721 transitions. [2022-04-18 16:36:41,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1721 transitions. [2022-04-18 16:36:41,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:41,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1721 transitions. [2022-04-18 16:36:41,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 286.8333333333333) internal successors, (1721), 6 states have internal predecessors, (1721), 0 states have call successors, (0), 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 16:36:41,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 16:36:41,733 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 16:36:41,733 INFO L186 Difference]: Start difference. First operand has 328 places, 326 transitions, 913 flow. Second operand 6 states and 1721 transitions. [2022-04-18 16:36:41,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 358 transitions, 1253 flow [2022-04-18 16:36:41,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 358 transitions, 1228 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-04-18 16:36:41,759 INFO L242 Difference]: Finished difference. Result has 333 places, 342 transitions, 1072 flow [2022-04-18 16:36:41,759 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1072, PETRI_PLACES=333, PETRI_TRANSITIONS=342} [2022-04-18 16:36:41,760 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, 3 predicate places. [2022-04-18 16:36:41,761 INFO L478 AbstractCegarLoop]: Abstraction has has 333 places, 342 transitions, 1072 flow [2022-04-18 16:36:41,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 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 16:36:41,762 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:41,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:41,762 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 16:36:41,762 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash 504388802, now seen corresponding path program 1 times [2022-04-18 16:36:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:41,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193307466] [2022-04-18 16:36:41,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:41,879 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 16:36:41,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:41,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193307466] [2022-04-18 16:36:41,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193307466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:41,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:41,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753107486] [2022-04-18 16:36:41,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:41,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:41,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:41,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:41,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:41,886 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 362 [2022-04-18 16:36:41,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 342 transitions, 1072 flow. Second operand has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 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 16:36:41,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:41,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 362 [2022-04-18 16:36:41,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:43,071 INFO L129 PetriNetUnfolder]: 2278/7172 cut-off events. [2022-04-18 16:36:43,071 INFO L130 PetriNetUnfolder]: For 7573/7714 co-relation queries the response was YES. [2022-04-18 16:36:43,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15476 conditions, 7172 events. 2278/7172 cut-off events. For 7573/7714 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 63702 event pairs, 1321 based on Foata normal form. 0/6681 useless extension candidates. Maximal degree in co-relation 15423. Up to 3204 conditions per place. [2022-04-18 16:36:43,153 INFO L132 encePairwiseOnDemand]: 357/362 looper letters, 90 selfloop transitions, 4 changer transitions 0/349 dead transitions. [2022-04-18 16:36:43,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 349 transitions, 1274 flow [2022-04-18 16:36:43,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1704 transitions. [2022-04-18 16:36:43,159 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7845303867403315 [2022-04-18 16:36:43,159 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1704 transitions. [2022-04-18 16:36:43,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1704 transitions. [2022-04-18 16:36:43,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:43,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1704 transitions. [2022-04-18 16:36:43,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 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 16:36:43,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 16:36:43,167 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 16:36:43,167 INFO L186 Difference]: Start difference. First operand has 333 places, 342 transitions, 1072 flow. Second operand 6 states and 1704 transitions. [2022-04-18 16:36:43,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 349 transitions, 1274 flow [2022-04-18 16:36:43,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 349 transitions, 1274 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 16:36:43,190 INFO L242 Difference]: Finished difference. Result has 337 places, 341 transitions, 1078 flow [2022-04-18 16:36:43,191 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1078, PETRI_PLACES=337, PETRI_TRANSITIONS=341} [2022-04-18 16:36:43,192 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, 7 predicate places. [2022-04-18 16:36:43,192 INFO L478 AbstractCegarLoop]: Abstraction has has 337 places, 341 transitions, 1078 flow [2022-04-18 16:36:43,193 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 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 16:36:43,193 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:43,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:43,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 16:36:43,193 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:43,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:43,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1497435077, now seen corresponding path program 1 times [2022-04-18 16:36:43,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:43,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846689691] [2022-04-18 16:36:43,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 16:36:43,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:43,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846689691] [2022-04-18 16:36:43,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846689691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:43,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:43,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:43,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691432408] [2022-04-18 16:36:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:43,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:43,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:43,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:43,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:43,316 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 362 [2022-04-18 16:36:43,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 341 transitions, 1078 flow. Second operand has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 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 16:36:43,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:43,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 362 [2022-04-18 16:36:43,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:45,667 INFO L129 PetriNetUnfolder]: 4571/12219 cut-off events. [2022-04-18 16:36:45,667 INFO L130 PetriNetUnfolder]: For 14795/15254 co-relation queries the response was YES. [2022-04-18 16:36:45,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28561 conditions, 12219 events. 4571/12219 cut-off events. For 14795/15254 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 113991 event pairs, 1236 based on Foata normal form. 21/11701 useless extension candidates. Maximal degree in co-relation 28508. Up to 4740 conditions per place. [2022-04-18 16:36:45,791 INFO L132 encePairwiseOnDemand]: 354/362 looper letters, 156 selfloop transitions, 26 changer transitions 0/430 dead transitions. [2022-04-18 16:36:45,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 430 transitions, 1876 flow [2022-04-18 16:36:45,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1740 transitions. [2022-04-18 16:36:45,796 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8011049723756906 [2022-04-18 16:36:45,796 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1740 transitions. [2022-04-18 16:36:45,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1740 transitions. [2022-04-18 16:36:45,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:45,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1740 transitions. [2022-04-18 16:36:45,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 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 16:36:45,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 16:36:45,856 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 16:36:45,856 INFO L186 Difference]: Start difference. First operand has 337 places, 341 transitions, 1078 flow. Second operand 6 states and 1740 transitions. [2022-04-18 16:36:45,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 430 transitions, 1876 flow [2022-04-18 16:36:45,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 430 transitions, 1869 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:36:45,941 INFO L242 Difference]: Finished difference. Result has 343 places, 366 transitions, 1375 flow [2022-04-18 16:36:45,941 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1375, PETRI_PLACES=343, PETRI_TRANSITIONS=366} [2022-04-18 16:36:45,942 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, 13 predicate places. [2022-04-18 16:36:45,942 INFO L478 AbstractCegarLoop]: Abstraction has has 343 places, 366 transitions, 1375 flow [2022-04-18 16:36:45,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 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 16:36:45,943 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:45,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:45,943 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-18 16:36:45,943 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:45,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2019895496, now seen corresponding path program 1 times [2022-04-18 16:36:45,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:45,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425052907] [2022-04-18 16:36:45,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:45,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:45,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 16:36:45,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:45,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425052907] [2022-04-18 16:36:45,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425052907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:45,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:45,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:45,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405407590] [2022-04-18 16:36:45,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:45,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:45,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:45,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:45,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:46,000 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 362 [2022-04-18 16:36:46,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 366 transitions, 1375 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:46,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:46,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 362 [2022-04-18 16:36:46,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:46,934 INFO L129 PetriNetUnfolder]: 1650/5708 cut-off events. [2022-04-18 16:36:46,934 INFO L130 PetriNetUnfolder]: For 15838/16029 co-relation queries the response was YES. [2022-04-18 16:36:46,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14626 conditions, 5708 events. 1650/5708 cut-off events. For 15838/16029 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 49865 event pairs, 335 based on Foata normal form. 0/5411 useless extension candidates. Maximal degree in co-relation 14570. Up to 1509 conditions per place. [2022-04-18 16:36:47,014 INFO L132 encePairwiseOnDemand]: 359/362 looper letters, 70 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2022-04-18 16:36:47,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 379 transitions, 1641 flow [2022-04-18 16:36:47,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2022-04-18 16:36:47,020 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8941068139963168 [2022-04-18 16:36:47,021 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2022-04-18 16:36:47,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2022-04-18 16:36:47,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:47,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2022-04-18 16:36:47,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 0 states have call successors, (0), 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 16:36:47,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:47,028 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:47,028 INFO L186 Difference]: Start difference. First operand has 343 places, 366 transitions, 1375 flow. Second operand 3 states and 971 transitions. [2022-04-18 16:36:47,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 379 transitions, 1641 flow [2022-04-18 16:36:47,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 379 transitions, 1571 flow, removed 35 selfloop flow, removed 0 redundant places. [2022-04-18 16:36:47,073 INFO L242 Difference]: Finished difference. Result has 344 places, 365 transitions, 1321 flow [2022-04-18 16:36:47,074 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1321, PETRI_PLACES=344, PETRI_TRANSITIONS=365} [2022-04-18 16:36:47,075 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, 14 predicate places. [2022-04-18 16:36:47,075 INFO L478 AbstractCegarLoop]: Abstraction has has 344 places, 365 transitions, 1321 flow [2022-04-18 16:36:47,076 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:47,076 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:47,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:47,076 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-18 16:36:47,076 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:47,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash -639229830, now seen corresponding path program 1 times [2022-04-18 16:36:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:47,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830198113] [2022-04-18 16:36:47,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:47,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:47,134 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 16:36:47,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:47,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830198113] [2022-04-18 16:36:47,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830198113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:47,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:47,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325787176] [2022-04-18 16:36:47,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:47,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:47,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:47,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:47,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:47,142 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 362 [2022-04-18 16:36:47,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 365 transitions, 1321 flow. Second operand has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 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 16:36:47,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:47,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 362 [2022-04-18 16:36:47,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:47,729 INFO L129 PetriNetUnfolder]: 841/3419 cut-off events. [2022-04-18 16:36:47,730 INFO L130 PetriNetUnfolder]: For 6520/6623 co-relation queries the response was YES. [2022-04-18 16:36:47,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7667 conditions, 3419 events. 841/3419 cut-off events. For 6520/6623 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 27169 event pairs, 128 based on Foata normal form. 0/3110 useless extension candidates. Maximal degree in co-relation 7610. Up to 874 conditions per place. [2022-04-18 16:36:47,762 INFO L132 encePairwiseOnDemand]: 360/362 looper letters, 51 selfloop transitions, 1 changer transitions 0/364 dead transitions. [2022-04-18 16:36:47,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 364 transitions, 1423 flow [2022-04-18 16:36:47,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2022-04-18 16:36:47,766 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9060773480662984 [2022-04-18 16:36:47,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 984 transitions. [2022-04-18 16:36:47,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 984 transitions. [2022-04-18 16:36:47,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:47,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 984 transitions. [2022-04-18 16:36:47,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 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 16:36:47,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:47,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:47,772 INFO L186 Difference]: Start difference. First operand has 344 places, 365 transitions, 1321 flow. Second operand 3 states and 984 transitions. [2022-04-18 16:36:47,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 364 transitions, 1423 flow [2022-04-18 16:36:47,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 364 transitions, 1419 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:47,788 INFO L242 Difference]: Finished difference. Result has 343 places, 364 transitions, 1317 flow [2022-04-18 16:36:47,789 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=343, PETRI_TRANSITIONS=364} [2022-04-18 16:36:47,790 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, 13 predicate places. [2022-04-18 16:36:47,790 INFO L478 AbstractCegarLoop]: Abstraction has has 343 places, 364 transitions, 1317 flow [2022-04-18 16:36:47,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 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 16:36:47,790 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:47,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:47,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-18 16:36:47,791 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:47,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:47,791 INFO L85 PathProgramCache]: Analyzing trace with hash -27302517, now seen corresponding path program 1 times [2022-04-18 16:36:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:47,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404116875] [2022-04-18 16:36:47,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:47,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 16:36:47,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:47,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404116875] [2022-04-18 16:36:47,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404116875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:47,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:47,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:47,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201288903] [2022-04-18 16:36:47,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:47,847 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:47,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:47,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:47,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:47,850 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-04-18 16:36:47,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 364 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 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 16:36:47,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:47,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-04-18 16:36:47,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:48,658 INFO L129 PetriNetUnfolder]: 1605/5123 cut-off events. [2022-04-18 16:36:48,658 INFO L130 PetriNetUnfolder]: For 11684/11918 co-relation queries the response was YES. [2022-04-18 16:36:48,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12570 conditions, 5123 events. 1605/5123 cut-off events. For 11684/11918 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 41594 event pairs, 278 based on Foata normal form. 6/4604 useless extension candidates. Maximal degree in co-relation 12513. Up to 1474 conditions per place. [2022-04-18 16:36:48,714 INFO L132 encePairwiseOnDemand]: 357/362 looper letters, 66 selfloop transitions, 2 changer transitions 23/376 dead transitions. [2022-04-18 16:36:48,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 376 transitions, 1563 flow [2022-04-18 16:36:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 976 transitions. [2022-04-18 16:36:48,717 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8987108655616943 [2022-04-18 16:36:48,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 976 transitions. [2022-04-18 16:36:48,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 976 transitions. [2022-04-18 16:36:48,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:48,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 976 transitions. [2022-04-18 16:36:48,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 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 16:36:48,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:48,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:48,722 INFO L186 Difference]: Start difference. First operand has 343 places, 364 transitions, 1317 flow. Second operand 3 states and 976 transitions. [2022-04-18 16:36:48,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 376 transitions, 1563 flow [2022-04-18 16:36:48,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 376 transitions, 1562 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:36:48,745 INFO L242 Difference]: Finished difference. Result has 342 places, 339 transitions, 1203 flow [2022-04-18 16:36:48,745 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1203, PETRI_PLACES=342, PETRI_TRANSITIONS=339} [2022-04-18 16:36:48,746 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, 12 predicate places. [2022-04-18 16:36:48,746 INFO L478 AbstractCegarLoop]: Abstraction has has 342 places, 339 transitions, 1203 flow [2022-04-18 16:36:48,747 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 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 16:36:48,747 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:48,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:48,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-18 16:36:48,747 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:48,748 INFO L85 PathProgramCache]: Analyzing trace with hash -467883571, now seen corresponding path program 1 times [2022-04-18 16:36:48,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:48,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952825106] [2022-04-18 16:36:48,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:48,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 16:36:48,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:48,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952825106] [2022-04-18 16:36:48,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952825106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:48,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:48,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:48,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928641367] [2022-04-18 16:36:48,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:48,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:48,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:48,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:48,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:48,799 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 362 [2022-04-18 16:36:48,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 339 transitions, 1203 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 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 16:36:48,800 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:48,800 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 362 [2022-04-18 16:36:48,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:49,386 INFO L129 PetriNetUnfolder]: 1154/4233 cut-off events. [2022-04-18 16:36:49,387 INFO L130 PetriNetUnfolder]: For 9453/9652 co-relation queries the response was YES. [2022-04-18 16:36:49,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10362 conditions, 4233 events. 1154/4233 cut-off events. For 9453/9652 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 36705 event pairs, 7 based on Foata normal form. 0/4050 useless extension candidates. Maximal degree in co-relation 10331. Up to 1182 conditions per place. [2022-04-18 16:36:49,436 INFO L132 encePairwiseOnDemand]: 359/362 looper letters, 50 selfloop transitions, 35 changer transitions 0/370 dead transitions. [2022-04-18 16:36:49,436 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 370 transitions, 1633 flow [2022-04-18 16:36:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2022-04-18 16:36:49,438 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9060773480662984 [2022-04-18 16:36:49,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 984 transitions. [2022-04-18 16:36:49,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 984 transitions. [2022-04-18 16:36:49,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:49,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 984 transitions. [2022-04-18 16:36:49,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 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 16:36:49,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:49,443 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 16:36:49,443 INFO L186 Difference]: Start difference. First operand has 342 places, 339 transitions, 1203 flow. Second operand 3 states and 984 transitions. [2022-04-18 16:36:49,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 370 transitions, 1633 flow [2022-04-18 16:36:49,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 370 transitions, 1585 flow, removed 8 selfloop flow, removed 10 redundant places. [2022-04-18 16:36:49,473 INFO L242 Difference]: Finished difference. Result has 317 places, 364 transitions, 1556 flow [2022-04-18 16:36:49,474 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1556, PETRI_PLACES=317, PETRI_TRANSITIONS=364} [2022-04-18 16:36:49,475 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, -13 predicate places. [2022-04-18 16:36:49,475 INFO L478 AbstractCegarLoop]: Abstraction has has 317 places, 364 transitions, 1556 flow [2022-04-18 16:36:49,475 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 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 16:36:49,475 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:49,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:36:49,476 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-18 16:36:49,476 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:36:49,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash -98196861, now seen corresponding path program 1 times [2022-04-18 16:36:49,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:49,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998020303] [2022-04-18 16:36:49,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:49,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 16:36:49,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:49,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998020303] [2022-04-18 16:36:49,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998020303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:49,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:49,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-18 16:36:49,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538932022] [2022-04-18 16:36:49,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:49,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-18 16:36:49,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:49,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-18 16:36:49,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-04-18 16:36:49,861 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 362 [2022-04-18 16:36:49,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 364 transitions, 1556 flow. Second operand has 20 states, 20 states have (on average 227.4) internal successors, (4548), 20 states have internal predecessors, (4548), 0 states have call successors, (0), 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 16:36:49,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:49,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 362 [2022-04-18 16:36:49,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:37:06,330 INFO L129 PetriNetUnfolder]: 55913/100754 cut-off events. [2022-04-18 16:37:06,331 INFO L130 PetriNetUnfolder]: For 77469/77901 co-relation queries the response was YES. [2022-04-18 16:37:07,007 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237110 conditions, 100754 events. 55913/100754 cut-off events. For 77469/77901 co-relation queries the response was YES. Maximal size of possible extension queue 2701. Compared 1053316 event pairs, 19362 based on Foata normal form. 294/92415 useless extension candidates. Maximal degree in co-relation 237048. Up to 28490 conditions per place. [2022-04-18 16:37:07,447 INFO L132 encePairwiseOnDemand]: 330/362 looper letters, 409 selfloop transitions, 69 changer transitions 12/671 dead transitions. [2022-04-18 16:37:07,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 671 transitions, 4590 flow [2022-04-18 16:37:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-18 16:37:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-04-18 16:37:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 6764 transitions. [2022-04-18 16:37:07,461 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.6443132025147648 [2022-04-18 16:37:07,461 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 6764 transitions. [2022-04-18 16:37:07,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 6764 transitions. [2022-04-18 16:37:07,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:37:07,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 6764 transitions. [2022-04-18 16:37:07,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 233.24137931034483) internal successors, (6764), 29 states have internal predecessors, (6764), 0 states have call successors, (0), 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 16:37:07,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 362.0) internal successors, (10860), 30 states have internal predecessors, (10860), 0 states have call successors, (0), 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 16:37:07,489 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 362.0) internal successors, (10860), 30 states have internal predecessors, (10860), 0 states have call successors, (0), 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 16:37:07,489 INFO L186 Difference]: Start difference. First operand has 317 places, 364 transitions, 1556 flow. Second operand 29 states and 6764 transitions. [2022-04-18 16:37:07,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 671 transitions, 4590 flow [2022-04-18 16:37:08,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 671 transitions, 4590 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 16:37:08,761 INFO L242 Difference]: Finished difference. Result has 349 places, 408 transitions, 2342 flow [2022-04-18 16:37:08,761 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2342, PETRI_PLACES=349, PETRI_TRANSITIONS=408} [2022-04-18 16:37:08,761 INFO L335 CegarLoopForPetriNet]: 330 programPoint places, 19 predicate places. [2022-04-18 16:37:08,762 INFO L478 AbstractCegarLoop]: Abstraction has has 349 places, 408 transitions, 2342 flow [2022-04-18 16:37:08,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 227.4) internal successors, (4548), 20 states have internal predecessors, (4548), 0 states have call successors, (0), 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 16:37:08,762 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:37:08,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:37:08,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-18 16:37:08,763 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-04-18 16:37:08,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:37:08,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1848322037, now seen corresponding path program 2 times [2022-04-18 16:37:08,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:37:08,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082955824] [2022-04-18 16:37:08,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:37:08,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:37:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:37:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 16:37:09,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:37:09,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082955824] [2022-04-18 16:37:09,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082955824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:37:09,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:37:09,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-18 16:37:09,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730062156] [2022-04-18 16:37:09,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:37:09,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-18 16:37:09,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:37:09,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-18 16:37:09,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-04-18 16:37:09,090 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 362 [2022-04-18 16:37:09,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 408 transitions, 2342 flow. Second operand has 20 states, 20 states have (on average 227.4) internal successors, (4548), 20 states have internal predecessors, (4548), 0 states have call successors, (0), 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 16:37:09,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:37:09,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 362 [2022-04-18 16:37:09,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand