./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-atomic/dekker-b.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/pthread-atomic/dekker-b.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8495a4f5aea7cc78cc34cbe091df9506d17978f2685019ca49cb76f0e1f4a919 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 11:26:59,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 11:26:59,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 11:26:59,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 11:26:59,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 11:26:59,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 11:26:59,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 11:26:59,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 11:26:59,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 11:26:59,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 11:26:59,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 11:26:59,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 11:26:59,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 11:26:59,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 11:26:59,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 11:26:59,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 11:26:59,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 11:26:59,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 11:26:59,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 11:26:59,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 11:26:59,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 11:26:59,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 11:26:59,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 11:26:59,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 11:26:59,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 11:26:59,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 11:26:59,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 11:26:59,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 11:26:59,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 11:26:59,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 11:26:59,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 11:26:59,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 11:26:59,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 11:26:59,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 11:26:59,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 11:26:59,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 11:26:59,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 11:26:59,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 11:26:59,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 11:26:59,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 11:26:59,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 11:26:59,782 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-31 11:26:59,818 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 11:26:59,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 11:26:59,819 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 11:26:59,820 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 11:26:59,820 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 11:26:59,821 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 11:26:59,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 11:26:59,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 11:26:59,822 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 11:26:59,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 11:26:59,823 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 11:26:59,823 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 11:26:59,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 11:26:59,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 11:26:59,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 11:26:59,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 11:26:59,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 11:26:59,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 11:26:59,824 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-31 11:26:59,824 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 11:26:59,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 11:26:59,825 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 11:26:59,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 11:26:59,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 11:26:59,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 11:26:59,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 11:26:59,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 11:26:59,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 11:26:59,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 11:26:59,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 11:26:59,826 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 11:26:59,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 11:26:59,827 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 11:26:59,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 11:26:59,827 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 11:26:59,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 11:26:59,828 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 11:26:59,828 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 8495a4f5aea7cc78cc34cbe091df9506d17978f2685019ca49cb76f0e1f4a919 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 11:27:00,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 11:27:00,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 11:27:00,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 11:27:00,177 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 11:27:00,177 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 11:27:00,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker-b.i [2023-08-31 11:27:01,228 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 11:27:01,487 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 11:27:01,488 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker-b.i [2023-08-31 11:27:01,500 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f298743/3f47a6546b2b42dcb488c2f110730e8c/FLAG0d03782c3 [2023-08-31 11:27:01,514 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f298743/3f47a6546b2b42dcb488c2f110730e8c [2023-08-31 11:27:01,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 11:27:01,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 11:27:01,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 11:27:01,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 11:27:01,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 11:27:01,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:27:01" (1/1) ... [2023-08-31 11:27:01,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749b7dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:01, skipping insertion in model container [2023-08-31 11:27:01,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:27:01" (1/1) ... [2023-08-31 11:27:01,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 11:27:01,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 11:27:01,869 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker-b.i[30165,30178] [2023-08-31 11:27:01,876 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker-b.i[30411,30424] [2023-08-31 11:27:01,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 11:27:01,898 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 11:27:01,941 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker-b.i[30165,30178] [2023-08-31 11:27:01,947 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker-b.i[30411,30424] [2023-08-31 11:27:01,958 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 11:27:02,000 INFO L208 MainTranslator]: Completed translation [2023-08-31 11:27:02,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:02 WrapperNode [2023-08-31 11:27:02,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 11:27:02,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 11:27:02,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 11:27:02,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 11:27:02,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:02" (1/1) ... [2023-08-31 11:27:02,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:02" (1/1) ... [2023-08-31 11:27:02,078 INFO L138 Inliner]: procedures = 168, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2023-08-31 11:27:02,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 11:27:02,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 11:27:02,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 11:27:02,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 11:27:02,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:02" (1/1) ... [2023-08-31 11:27:02,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:02" (1/1) ... [2023-08-31 11:27:02,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:02" (1/1) ... [2023-08-31 11:27:02,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:02" (1/1) ... [2023-08-31 11:27:02,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:02" (1/1) ... [2023-08-31 11:27:02,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:02" (1/1) ... [2023-08-31 11:27:02,128 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:02" (1/1) ... [2023-08-31 11:27:02,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:02" (1/1) ... [2023-08-31 11:27:02,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 11:27:02,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 11:27:02,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 11:27:02,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 11:27:02,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:02" (1/1) ... [2023-08-31 11:27:02,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 11:27:02,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 11:27:02,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 11:27:02,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 11:27:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 11:27:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-08-31 11:27:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-08-31 11:27:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-31 11:27:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-31 11:27:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 11:27:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 11:27:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 11:27:02,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 11:27:02,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 11:27:02,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 11:27:02,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 11:27:02,214 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 11:27:02,342 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 11:27:02,343 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 11:27:02,688 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 11:27:02,696 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 11:27:02,696 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-31 11:27:02,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:27:02 BoogieIcfgContainer [2023-08-31 11:27:02,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 11:27:02,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 11:27:02,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 11:27:02,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 11:27:02,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:27:01" (1/3) ... [2023-08-31 11:27:02,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cef5f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:27:02, skipping insertion in model container [2023-08-31 11:27:02,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:02" (2/3) ... [2023-08-31 11:27:02,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cef5f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:27:02, skipping insertion in model container [2023-08-31 11:27:02,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:27:02" (3/3) ... [2023-08-31 11:27:02,705 INFO L112 eAbstractionObserver]: Analyzing ICFG dekker-b.i [2023-08-31 11:27:02,713 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 11:27:02,721 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 11:27:02,721 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-08-31 11:27:02,721 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 11:27:02,807 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-31 11:27:02,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 197 transitions, 410 flow [2023-08-31 11:27:02,896 INFO L130 PetriNetUnfolder]: 14/195 cut-off events. [2023-08-31 11:27:02,896 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 11:27:02,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 195 events. 14/195 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 459 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 145. Up to 3 conditions per place. [2023-08-31 11:27:02,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 197 transitions, 410 flow [2023-08-31 11:27:02,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 186 transitions, 381 flow [2023-08-31 11:27:02,918 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 11:27:02,926 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 186 transitions, 381 flow [2023-08-31 11:27:02,929 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 186 transitions, 381 flow [2023-08-31 11:27:02,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 186 transitions, 381 flow [2023-08-31 11:27:02,963 INFO L130 PetriNetUnfolder]: 14/186 cut-off events. [2023-08-31 11:27:02,963 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-31 11:27:02,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 186 events. 14/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 458 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 145. Up to 3 conditions per place. [2023-08-31 11:27:02,970 INFO L119 LiptonReduction]: Number of co-enabled transitions 12096 [2023-08-31 11:27:05,981 INFO L134 LiptonReduction]: Checked pairs total: 79496 [2023-08-31 11:27:05,981 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-31 11:27:05,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 11:27:06,000 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@38289a69, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 11:27:06,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2023-08-31 11:27:06,001 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 11:27:06,002 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 11:27:06,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:27:06,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 11:27:06,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-08-31 11:27:06,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:27:06,007 INFO L85 PathProgramCache]: Analyzing trace with hash 721, now seen corresponding path program 1 times [2023-08-31 11:27:06,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:27:06,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771475367] [2023-08-31 11:27:06,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:27:06,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:27:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:27:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 11:27:06,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:27:06,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771475367] [2023-08-31 11:27:06,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771475367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:27:06,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:27:06,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 11:27:06,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181357933] [2023-08-31 11:27:06,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:27:06,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 11:27:06,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:27:06,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 11:27:06,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 11:27:06,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 311 [2023-08-31 11:27:06,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 103 transitions, 215 flow. Second operand has 2 states, 2 states have (on average 184.5) internal successors, (369), 2 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:06,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:27:06,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 311 [2023-08-31 11:27:06,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:27:06,402 INFO L130 PetriNetUnfolder]: 587/1571 cut-off events. [2023-08-31 11:27:06,402 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-31 11:27:06,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 1571 events. 587/1571 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 11438 event pairs, 501 based on Foata normal form. 142/1528 useless extension candidates. Maximal degree in co-relation 2425. Up to 947 conditions per place. [2023-08-31 11:27:06,414 INFO L137 encePairwiseOnDemand]: 302/311 looper letters, 33 selfloop transitions, 0 changer transitions 0/93 dead transitions. [2023-08-31 11:27:06,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 261 flow [2023-08-31 11:27:06,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 11:27:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 11:27:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 410 transitions. [2023-08-31 11:27:06,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6591639871382636 [2023-08-31 11:27:06,428 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 410 transitions. [2023-08-31 11:27:06,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 410 transitions. [2023-08-31 11:27:06,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:27:06,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 410 transitions. [2023-08-31 11:27:06,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 205.0) internal successors, (410), 2 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:06,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:06,439 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:06,441 INFO L175 Difference]: Start difference. First operand has 99 places, 103 transitions, 215 flow. Second operand 2 states and 410 transitions. [2023-08-31 11:27:06,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 261 flow [2023-08-31 11:27:06,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 11:27:06,447 INFO L231 Difference]: Finished difference. Result has 92 places, 93 transitions, 190 flow [2023-08-31 11:27:06,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=190, PETRI_PLACES=92, PETRI_TRANSITIONS=93} [2023-08-31 11:27:06,452 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -7 predicate places. [2023-08-31 11:27:06,452 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 93 transitions, 190 flow [2023-08-31 11:27:06,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 184.5) internal successors, (369), 2 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:06,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:27:06,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 11:27:06,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 11:27:06,454 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-08-31 11:27:06,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:27:06,454 INFO L85 PathProgramCache]: Analyzing trace with hash 692113465, now seen corresponding path program 1 times [2023-08-31 11:27:06,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:27:06,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538487666] [2023-08-31 11:27:06,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:27:06,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:27:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:27:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 11:27:06,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:27:06,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538487666] [2023-08-31 11:27:06,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538487666] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:27:06,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:27:06,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 11:27:06,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324608516] [2023-08-31 11:27:06,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:27:06,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 11:27:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:27:06,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 11:27:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 11:27:06,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 311 [2023-08-31 11:27:06,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 93 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:06,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:27:06,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 311 [2023-08-31 11:27:06,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:27:06,845 INFO L130 PetriNetUnfolder]: 810/2093 cut-off events. [2023-08-31 11:27:06,846 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-31 11:27:06,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3410 conditions, 2093 events. 810/2093 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 15304 event pairs, 625 based on Foata normal form. 0/1812 useless extension candidates. Maximal degree in co-relation 3407. Up to 1209 conditions per place. [2023-08-31 11:27:06,858 INFO L137 encePairwiseOnDemand]: 307/311 looper letters, 53 selfloop transitions, 3 changer transitions 0/112 dead transitions. [2023-08-31 11:27:06,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 112 transitions, 342 flow [2023-08-31 11:27:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 11:27:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 11:27:06,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2023-08-31 11:27:06,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6237942122186495 [2023-08-31 11:27:06,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 582 transitions. [2023-08-31 11:27:06,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 582 transitions. [2023-08-31 11:27:06,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:27:06,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 582 transitions. [2023-08-31 11:27:06,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:06,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:06,870 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:06,870 INFO L175 Difference]: Start difference. First operand has 92 places, 93 transitions, 190 flow. Second operand 3 states and 582 transitions. [2023-08-31 11:27:06,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 112 transitions, 342 flow [2023-08-31 11:27:06,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 112 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 11:27:06,874 INFO L231 Difference]: Finished difference. Result has 95 places, 95 transitions, 209 flow [2023-08-31 11:27:06,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=95, PETRI_TRANSITIONS=95} [2023-08-31 11:27:06,875 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -4 predicate places. [2023-08-31 11:27:06,876 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 95 transitions, 209 flow [2023-08-31 11:27:06,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:06,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:27:06,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 11:27:06,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 11:27:06,878 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-08-31 11:27:06,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:27:06,880 INFO L85 PathProgramCache]: Analyzing trace with hash -598758925, now seen corresponding path program 1 times [2023-08-31 11:27:06,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:27:06,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139160572] [2023-08-31 11:27:06,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:27:06,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:27:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:27:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 11:27:06,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:27:06,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139160572] [2023-08-31 11:27:06,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139160572] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:27:06,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:27:06,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 11:27:06,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339741590] [2023-08-31 11:27:06,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:27:06,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 11:27:06,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:27:06,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 11:27:06,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 11:27:06,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 311 [2023-08-31 11:27:06,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 95 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:06,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:27:06,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 311 [2023-08-31 11:27:06,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:27:07,348 INFO L130 PetriNetUnfolder]: 1396/3948 cut-off events. [2023-08-31 11:27:07,349 INFO L131 PetriNetUnfolder]: For 70/122 co-relation queries the response was YES. [2023-08-31 11:27:07,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6276 conditions, 3948 events. 1396/3948 cut-off events. For 70/122 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 34225 event pairs, 292 based on Foata normal form. 30/3449 useless extension candidates. Maximal degree in co-relation 6271. Up to 1172 conditions per place. [2023-08-31 11:27:07,370 INFO L137 encePairwiseOnDemand]: 304/311 looper letters, 64 selfloop transitions, 6 changer transitions 0/127 dead transitions. [2023-08-31 11:27:07,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 127 transitions, 416 flow [2023-08-31 11:27:07,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 11:27:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 11:27:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 601 transitions. [2023-08-31 11:27:07,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6441586280814576 [2023-08-31 11:27:07,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 601 transitions. [2023-08-31 11:27:07,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 601 transitions. [2023-08-31 11:27:07,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:27:07,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 601 transitions. [2023-08-31 11:27:07,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:07,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:07,377 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:07,378 INFO L175 Difference]: Start difference. First operand has 95 places, 95 transitions, 209 flow. Second operand 3 states and 601 transitions. [2023-08-31 11:27:07,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 127 transitions, 416 flow [2023-08-31 11:27:07,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 127 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 11:27:07,381 INFO L231 Difference]: Finished difference. Result has 98 places, 101 transitions, 256 flow [2023-08-31 11:27:07,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=98, PETRI_TRANSITIONS=101} [2023-08-31 11:27:07,382 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -1 predicate places. [2023-08-31 11:27:07,382 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 101 transitions, 256 flow [2023-08-31 11:27:07,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:07,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:27:07,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 11:27:07,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 11:27:07,383 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-08-31 11:27:07,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:27:07,384 INFO L85 PathProgramCache]: Analyzing trace with hash -564568659, now seen corresponding path program 1 times [2023-08-31 11:27:07,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:27:07,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000599748] [2023-08-31 11:27:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:27:07,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:27:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:27:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 11:27:07,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:27:07,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000599748] [2023-08-31 11:27:07,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000599748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:27:07,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:27:07,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 11:27:07,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032720582] [2023-08-31 11:27:07,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:27:07,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 11:27:07,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:27:07,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 11:27:07,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 11:27:07,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 311 [2023-08-31 11:27:07,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 101 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:07,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:27:07,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 311 [2023-08-31 11:27:07,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:27:07,771 INFO L130 PetriNetUnfolder]: 1419/3747 cut-off events. [2023-08-31 11:27:07,772 INFO L131 PetriNetUnfolder]: For 621/713 co-relation queries the response was YES. [2023-08-31 11:27:07,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6601 conditions, 3747 events. 1419/3747 cut-off events. For 621/713 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 31240 event pairs, 904 based on Foata normal form. 44/3262 useless extension candidates. Maximal degree in co-relation 6595. Up to 2086 conditions per place. [2023-08-31 11:27:07,818 INFO L137 encePairwiseOnDemand]: 307/311 looper letters, 55 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2023-08-31 11:27:07,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 119 transitions, 421 flow [2023-08-31 11:27:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 11:27:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 11:27:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2023-08-31 11:27:07,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6205787781350482 [2023-08-31 11:27:07,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 579 transitions. [2023-08-31 11:27:07,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions. [2023-08-31 11:27:07,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:27:07,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions. [2023-08-31 11:27:07,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:07,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:07,825 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:07,825 INFO L175 Difference]: Start difference. First operand has 98 places, 101 transitions, 256 flow. Second operand 3 states and 579 transitions. [2023-08-31 11:27:07,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 119 transitions, 421 flow [2023-08-31 11:27:07,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 119 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 11:27:07,830 INFO L231 Difference]: Finished difference. Result has 99 places, 104 transitions, 277 flow [2023-08-31 11:27:07,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=277, PETRI_PLACES=99, PETRI_TRANSITIONS=104} [2023-08-31 11:27:07,831 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2023-08-31 11:27:07,831 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 104 transitions, 277 flow [2023-08-31 11:27:07,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:07,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:27:07,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 11:27:07,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 11:27:07,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-08-31 11:27:07,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:27:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1384434450, now seen corresponding path program 1 times [2023-08-31 11:27:07,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:27:07,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609721810] [2023-08-31 11:27:07,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:27:07,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:27:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:27:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 11:27:07,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:27:07,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609721810] [2023-08-31 11:27:07,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609721810] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:27:07,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:27:07,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 11:27:07,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116419883] [2023-08-31 11:27:07,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:27:07,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 11:27:07,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:27:07,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 11:27:07,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 11:27:07,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 311 [2023-08-31 11:27:07,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 104 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:07,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:27:07,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 311 [2023-08-31 11:27:07,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:27:08,414 INFO L130 PetriNetUnfolder]: 2518/6878 cut-off events. [2023-08-31 11:27:08,416 INFO L131 PetriNetUnfolder]: For 846/928 co-relation queries the response was YES. [2023-08-31 11:27:08,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11780 conditions, 6878 events. 2518/6878 cut-off events. For 846/928 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 65506 event pairs, 559 based on Foata normal form. 5/5928 useless extension candidates. Maximal degree in co-relation 11773. Up to 2001 conditions per place. [2023-08-31 11:27:08,464 INFO L137 encePairwiseOnDemand]: 304/311 looper letters, 70 selfloop transitions, 7 changer transitions 0/137 dead transitions. [2023-08-31 11:27:08,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 137 transitions, 514 flow [2023-08-31 11:27:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 11:27:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 11:27:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2023-08-31 11:27:08,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6430868167202572 [2023-08-31 11:27:08,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 600 transitions. [2023-08-31 11:27:08,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 600 transitions. [2023-08-31 11:27:08,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:27:08,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 600 transitions. [2023-08-31 11:27:08,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:08,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:08,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:08,473 INFO L175 Difference]: Start difference. First operand has 99 places, 104 transitions, 277 flow. Second operand 3 states and 600 transitions. [2023-08-31 11:27:08,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 137 transitions, 514 flow [2023-08-31 11:27:08,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 137 transitions, 509 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 11:27:08,478 INFO L231 Difference]: Finished difference. Result has 102 places, 111 transitions, 336 flow [2023-08-31 11:27:08,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=102, PETRI_TRANSITIONS=111} [2023-08-31 11:27:08,481 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 3 predicate places. [2023-08-31 11:27:08,482 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 111 transitions, 336 flow [2023-08-31 11:27:08,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:08,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:27:08,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 11:27:08,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 11:27:08,483 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-08-31 11:27:08,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:27:08,483 INFO L85 PathProgramCache]: Analyzing trace with hash -627398240, now seen corresponding path program 1 times [2023-08-31 11:27:08,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:27:08,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309576475] [2023-08-31 11:27:08,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:27:08,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:27:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 11:27:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 11:27:08,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 11:27:08,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309576475] [2023-08-31 11:27:08,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309576475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 11:27:08,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 11:27:08,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 11:27:08,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833099875] [2023-08-31 11:27:08,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 11:27:08,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 11:27:08,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 11:27:08,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 11:27:08,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 11:27:08,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 311 [2023-08-31 11:27:08,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 111 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:08,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 11:27:08,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 311 [2023-08-31 11:27:08,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 11:27:08,971 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L693-2-->L694: Formula: (<= 1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[][18], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 141#L725-4true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), 137#L694true, Black: 212#true, 53#L716true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true]) [2023-08-31 11:27:08,971 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-31 11:27:08,972 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 11:27:08,972 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 11:27:08,972 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 11:27:08,980 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L693-2-->L694: Formula: (<= 1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[][18], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 67#L726-6true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), 137#L694true, Black: 212#true, 53#L716true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true]) [2023-08-31 11:27:08,980 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-31 11:27:08,981 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 11:27:08,981 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 11:27:08,981 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 11:27:09,000 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([626] L700-->L700-2: Formula: (= |v_#race~x~0_17| |v_thr1Thread1of1ForFork0_#t~nondet6_17|) InVars {} OutVars{#race~x~0=|v_#race~x~0_17|, thr1Thread1of1ForFork0_#t~nondet6=|v_thr1Thread1of1ForFork0_#t~nondet6_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread1of1ForFork0_#t~nondet6][26], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 141#L725-4true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), Black: 212#true, 53#L716true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true, 10#L700-2true]) [2023-08-31 11:27:09,000 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-31 11:27:09,000 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 11:27:09,000 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 11:27:09,000 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 11:27:09,007 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([626] L700-->L700-2: Formula: (= |v_#race~x~0_17| |v_thr1Thread1of1ForFork0_#t~nondet6_17|) InVars {} OutVars{#race~x~0=|v_#race~x~0_17|, thr1Thread1of1ForFork0_#t~nondet6=|v_thr1Thread1of1ForFork0_#t~nondet6_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread1of1ForFork0_#t~nondet6][26], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 67#L726-6true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), Black: 212#true, 53#L716true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true, 10#L700-2true]) [2023-08-31 11:27:09,008 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-31 11:27:09,008 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 11:27:09,008 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-31 11:27:09,008 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 11:27:09,013 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L693-2-->L694: Formula: (<= 1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[][18], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 141#L725-4true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), 137#L694true, Black: 212#true, 218#true, Black: 201#true, thr2Thread1of1ForFork1InUse, 163#L716-6true]) [2023-08-31 11:27:09,014 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-31 11:27:09,014 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-31 11:27:09,014 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 11:27:09,014 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 11:27:09,022 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L693-2-->L694: Formula: (<= 1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[][18], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 137#L694true, 67#L726-6true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), Black: 212#true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true, 163#L716-6true]) [2023-08-31 11:27:09,022 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-31 11:27:09,022 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 11:27:09,023 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 11:27:09,023 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 11:27:09,040 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([626] L700-->L700-2: Formula: (= |v_#race~x~0_17| |v_thr1Thread1of1ForFork0_#t~nondet6_17|) InVars {} OutVars{#race~x~0=|v_#race~x~0_17|, thr1Thread1of1ForFork0_#t~nondet6=|v_thr1Thread1of1ForFork0_#t~nondet6_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread1of1ForFork0_#t~nondet6][26], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 141#L725-4true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), Black: 212#true, 218#true, Black: 201#true, thr2Thread1of1ForFork1InUse, 163#L716-6true, 10#L700-2true]) [2023-08-31 11:27:09,040 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-31 11:27:09,041 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 11:27:09,041 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 11:27:09,041 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 11:27:09,041 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L693-2-->L694: Formula: (<= 1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[][18], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 141#L725-4true, 77#L717-2true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), 137#L694true, Black: 212#true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true]) [2023-08-31 11:27:09,041 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-31 11:27:09,041 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 11:27:09,042 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-31 11:27:09,042 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 11:27:09,049 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([626] L700-->L700-2: Formula: (= |v_#race~x~0_17| |v_thr1Thread1of1ForFork0_#t~nondet6_17|) InVars {} OutVars{#race~x~0=|v_#race~x~0_17|, thr1Thread1of1ForFork0_#t~nondet6=|v_thr1Thread1of1ForFork0_#t~nondet6_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread1of1ForFork0_#t~nondet6][26], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 67#L726-6true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), Black: 212#true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true, 163#L716-6true, 10#L700-2true]) [2023-08-31 11:27:09,049 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-31 11:27:09,049 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 11:27:09,049 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 11:27:09,049 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 11:27:09,050 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L693-2-->L694: Formula: (<= 1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[][18], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 77#L717-2true, 67#L726-6true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), 137#L694true, Black: 212#true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true]) [2023-08-31 11:27:09,050 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-31 11:27:09,050 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 11:27:09,050 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 11:27:09,050 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 11:27:09,056 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L693-2-->L694: Formula: (<= 1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[][18], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 141#L725-4true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), 137#L694true, 128#L718true, Black: 212#true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true]) [2023-08-31 11:27:09,056 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-31 11:27:09,056 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 11:27:09,056 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-31 11:27:09,057 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 11:27:09,057 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([592] L718-1-->L718-3: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet14_13| |v_#race~flag2~0_16|) InVars {} OutVars{thr2Thread1of1ForFork1_#t~nondet14=|v_thr2Thread1of1ForFork1_#t~nondet14_13|, #race~flag2~0=|v_#race~flag2~0_16|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_#t~nondet14, #race~flag2~0][119], [214#(= |#race~flag1~0| 0), 116#L693-2true, 220#(= ~flag2~0 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 141#L725-4true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), Black: 212#true, 144#L718-3true, thr2Thread1of1ForFork1InUse, Black: 203#(= |#race~flag2~0| 0)]) [2023-08-31 11:27:09,057 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-31 11:27:09,057 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 11:27:09,057 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 11:27:09,057 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 11:27:09,061 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L693-2-->L694: Formula: (<= 1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[][18], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 67#L726-6true, 137#L694true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), 128#L718true, Black: 212#true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true]) [2023-08-31 11:27:09,061 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-31 11:27:09,061 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 11:27:09,061 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 11:27:09,061 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 11:27:09,061 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([592] L718-1-->L718-3: Formula: (= |v_thr2Thread1of1ForFork1_#t~nondet14_13| |v_#race~flag2~0_16|) InVars {} OutVars{thr2Thread1of1ForFork1_#t~nondet14=|v_thr2Thread1of1ForFork1_#t~nondet14_13|, #race~flag2~0=|v_#race~flag2~0_16|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_#t~nondet14, #race~flag2~0][119], [214#(= |#race~flag1~0| 0), 116#L693-2true, 220#(= ~flag2~0 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 67#L726-6true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), Black: 212#true, thr2Thread1of1ForFork1InUse, 144#L718-3true, Black: 203#(= |#race~flag2~0| 0)]) [2023-08-31 11:27:09,062 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-31 11:27:09,062 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 11:27:09,062 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 11:27:09,062 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 11:27:09,066 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([626] L700-->L700-2: Formula: (= |v_#race~x~0_17| |v_thr1Thread1of1ForFork0_#t~nondet6_17|) InVars {} OutVars{#race~x~0=|v_#race~x~0_17|, thr1Thread1of1ForFork0_#t~nondet6=|v_thr1Thread1of1ForFork0_#t~nondet6_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread1of1ForFork0_#t~nondet6][26], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 141#L725-4true, 77#L717-2true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), Black: 212#true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true, 10#L700-2true]) [2023-08-31 11:27:09,066 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-31 11:27:09,066 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 11:27:09,066 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 11:27:09,066 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 11:27:09,068 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([626] L700-->L700-2: Formula: (= |v_#race~x~0_17| |v_thr1Thread1of1ForFork0_#t~nondet6_17|) InVars {} OutVars{#race~x~0=|v_#race~x~0_17|, thr1Thread1of1ForFork0_#t~nondet6=|v_thr1Thread1of1ForFork0_#t~nondet6_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread1of1ForFork0_#t~nondet6][26], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 77#L717-2true, 67#L726-6true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), Black: 212#true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true, 10#L700-2true]) [2023-08-31 11:27:09,068 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-31 11:27:09,068 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 11:27:09,068 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 11:27:09,068 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 11:27:09,071 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([626] L700-->L700-2: Formula: (= |v_#race~x~0_17| |v_thr1Thread1of1ForFork0_#t~nondet6_17|) InVars {} OutVars{#race~x~0=|v_#race~x~0_17|, thr1Thread1of1ForFork0_#t~nondet6=|v_thr1Thread1of1ForFork0_#t~nondet6_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread1of1ForFork0_#t~nondet6][25], [214#(= |#race~flag1~0| 0), 220#(= ~flag2~0 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 141#L725-4true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), 12#L718-1true, Black: 212#true, thr2Thread1of1ForFork1InUse, Black: 201#true, 10#L700-2true]) [2023-08-31 11:27:09,071 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 11:27:09,071 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 11:27:09,071 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-31 11:27:09,071 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-31 11:27:09,072 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([626] L700-->L700-2: Formula: (= |v_#race~x~0_17| |v_thr1Thread1of1ForFork0_#t~nondet6_17|) InVars {} OutVars{#race~x~0=|v_#race~x~0_17|, thr1Thread1of1ForFork0_#t~nondet6=|v_thr1Thread1of1ForFork0_#t~nondet6_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread1of1ForFork0_#t~nondet6][26], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 141#L725-4true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), 128#L718true, Black: 212#true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true, 10#L700-2true]) [2023-08-31 11:27:09,072 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-31 11:27:09,072 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 11:27:09,072 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 11:27:09,072 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 11:27:09,073 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([626] L700-->L700-2: Formula: (= |v_#race~x~0_17| |v_thr1Thread1of1ForFork0_#t~nondet6_17|) InVars {} OutVars{#race~x~0=|v_#race~x~0_17|, thr1Thread1of1ForFork0_#t~nondet6=|v_thr1Thread1of1ForFork0_#t~nondet6_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread1of1ForFork0_#t~nondet6][25], [214#(= |#race~flag1~0| 0), 220#(= ~flag2~0 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 67#L726-6true, 12#L718-1true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), Black: 212#true, thr2Thread1of1ForFork1InUse, Black: 201#true, 10#L700-2true]) [2023-08-31 11:27:09,073 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-31 11:27:09,073 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 11:27:09,073 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 11:27:09,073 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 11:27:09,073 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([626] L700-->L700-2: Formula: (= |v_#race~x~0_17| |v_thr1Thread1of1ForFork0_#t~nondet6_17|) InVars {} OutVars{#race~x~0=|v_#race~x~0_17|, thr1Thread1of1ForFork0_#t~nondet6=|v_thr1Thread1of1ForFork0_#t~nondet6_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread1of1ForFork0_#t~nondet6][26], [214#(= |#race~flag1~0| 0), Black: 209#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 193#true, 67#L726-6true, Black: 198#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), 128#L718true, Black: 212#true, 218#true, thr2Thread1of1ForFork1InUse, Black: 201#true, 10#L700-2true]) [2023-08-31 11:27:09,074 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-31 11:27:09,074 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-31 11:27:09,074 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-31 11:27:09,074 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 11:27:09,076 INFO L130 PetriNetUnfolder]: 2478/6456 cut-off events. [2023-08-31 11:27:09,076 INFO L131 PetriNetUnfolder]: For 993/1105 co-relation queries the response was YES. [2023-08-31 11:27:09,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11783 conditions, 6456 events. 2478/6456 cut-off events. For 993/1105 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 59456 event pairs, 763 based on Foata normal form. 88/5723 useless extension candidates. Maximal degree in co-relation 11775. Up to 2388 conditions per place. [2023-08-31 11:27:09,118 INFO L137 encePairwiseOnDemand]: 305/311 looper letters, 56 selfloop transitions, 5 changer transitions 0/129 dead transitions. [2023-08-31 11:27:09,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 129 transitions, 511 flow [2023-08-31 11:27:09,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 11:27:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 11:27:09,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 586 transitions. [2023-08-31 11:27:09,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6280814576634512 [2023-08-31 11:27:09,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 586 transitions. [2023-08-31 11:27:09,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 586 transitions. [2023-08-31 11:27:09,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 11:27:09,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 586 transitions. [2023-08-31 11:27:09,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:09,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:09,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:09,125 INFO L175 Difference]: Start difference. First operand has 102 places, 111 transitions, 336 flow. Second operand 3 states and 586 transitions. [2023-08-31 11:27:09,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 129 transitions, 511 flow [2023-08-31 11:27:09,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 129 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 11:27:09,131 INFO L231 Difference]: Finished difference. Result has 103 places, 111 transitions, 339 flow [2023-08-31 11:27:09,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=103, PETRI_TRANSITIONS=111} [2023-08-31 11:27:09,132 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 4 predicate places. [2023-08-31 11:27:09,132 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 111 transitions, 339 flow [2023-08-31 11:27:09,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 11:27:09,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 11:27:09,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 11:27:09,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 11:27:09,133 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-08-31 11:27:09,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 11:27:09,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2128350431, now seen corresponding path program 1 times [2023-08-31 11:27:09,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 11:27:09,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001354368] [2023-08-31 11:27:09,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 11:27:09,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 11:27:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 11:27:09,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 11:27:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 11:27:09,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 11:27:09,178 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 11:27:09,179 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2023-08-31 11:27:09,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2023-08-31 11:27:09,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2023-08-31 11:27:09,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2023-08-31 11:27:09,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2023-08-31 11:27:09,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2023-08-31 11:27:09,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2023-08-31 11:27:09,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2023-08-31 11:27:09,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2023-08-31 11:27:09,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2023-08-31 11:27:09,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2023-08-31 11:27:09,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2023-08-31 11:27:09,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2023-08-31 11:27:09,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2023-08-31 11:27:09,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2023-08-31 11:27:09,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2023-08-31 11:27:09,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2023-08-31 11:27:09,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2023-08-31 11:27:09,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2023-08-31 11:27:09,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2023-08-31 11:27:09,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2023-08-31 11:27:09,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2023-08-31 11:27:09,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2023-08-31 11:27:09,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2023-08-31 11:27:09,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2023-08-31 11:27:09,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 46 remaining) [2023-08-31 11:27:09,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 46 remaining) [2023-08-31 11:27:09,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2023-08-31 11:27:09,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2023-08-31 11:27:09,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2023-08-31 11:27:09,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2023-08-31 11:27:09,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2023-08-31 11:27:09,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2023-08-31 11:27:09,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2023-08-31 11:27:09,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2023-08-31 11:27:09,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2023-08-31 11:27:09,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2023-08-31 11:27:09,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2023-08-31 11:27:09,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2023-08-31 11:27:09,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2023-08-31 11:27:09,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2023-08-31 11:27:09,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2023-08-31 11:27:09,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2023-08-31 11:27:09,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2023-08-31 11:27:09,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2023-08-31 11:27:09,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2023-08-31 11:27:09,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 11:27:09,190 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-31 11:27:09,196 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 11:27:09,196 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 11:27:09,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:27:09 BasicIcfg [2023-08-31 11:27:09,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 11:27:09,220 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 11:27:09,220 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 11:27:09,220 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 11:27:09,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:27:02" (3/4) ... [2023-08-31 11:27:09,223 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 11:27:09,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 11:27:09,224 INFO L158 Benchmark]: Toolchain (without parser) took 7706.21ms. Allocated memory was 83.9MB in the beginning and 444.6MB in the end (delta: 360.7MB). Free memory was 60.7MB in the beginning and 176.8MB in the end (delta: -116.2MB). Peak memory consumption was 246.6MB. Max. memory is 16.1GB. [2023-08-31 11:27:09,224 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 11:27:09,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.07ms. Allocated memory is still 83.9MB. Free memory was 60.4MB in the beginning and 61.1MB in the end (delta: -636.7kB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2023-08-31 11:27:09,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.77ms. Allocated memory is still 83.9MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 11:27:09,225 INFO L158 Benchmark]: Boogie Preprocessor took 58.10ms. Allocated memory is still 83.9MB. Free memory was 59.0MB in the beginning and 57.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 11:27:09,225 INFO L158 Benchmark]: RCFGBuilder took 559.23ms. Allocated memory is still 83.9MB. Free memory was 57.0MB in the beginning and 39.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-08-31 11:27:09,226 INFO L158 Benchmark]: TraceAbstraction took 6519.91ms. Allocated memory was 83.9MB in the beginning and 444.6MB in the end (delta: 360.7MB). Free memory was 38.2MB in the beginning and 177.9MB in the end (delta: -139.7MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. [2023-08-31 11:27:09,226 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 444.6MB. Free memory was 177.9MB in the beginning and 176.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 11:27:09,227 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.07ms. Allocated memory is still 83.9MB. Free memory was 60.4MB in the beginning and 61.1MB in the end (delta: -636.7kB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.77ms. Allocated memory is still 83.9MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.10ms. Allocated memory is still 83.9MB. Free memory was 59.0MB in the beginning and 57.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 559.23ms. Allocated memory is still 83.9MB. Free memory was 57.0MB in the beginning and 39.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6519.91ms. Allocated memory was 83.9MB in the beginning and 444.6MB in the end (delta: 360.7MB). Free memory was 38.2MB in the beginning and 177.9MB in the end (delta: -139.7MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 444.6MB. Free memory was 177.9MB in the beginning and 176.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 179 PlacesBefore, 99 PlacesAfterwards, 186 TransitionsBefore, 103 TransitionsAfterwards, 12096 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 114 TotalNumberOfCompositions, 79496 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26805, independent: 25465, independent conditional: 0, independent unconditional: 25465, dependent: 1340, dependent conditional: 0, dependent unconditional: 1340, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5639, independent: 5520, independent conditional: 0, independent unconditional: 5520, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26805, independent: 19945, independent conditional: 0, independent unconditional: 19945, dependent: 1221, dependent conditional: 0, dependent unconditional: 1221, unknown: 5639, unknown conditional: 0, unknown unconditional: 5639] , Statistics on independence cache: Total cache size (in pairs): 1469, Positive cache size: 1384, Positive conditional cache size: 0, Positive unconditional cache size: 1384, Negative cache size: 85, Negative conditional cache size: 0, Negative unconditional cache size: 85, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - DataRaceFoundResult [Line: 693]: Data race detected Data race detected The following path leads to a data race: [L688] 0 int flag1 = 0, flag2 = 0; [L689] 0 int turn; [L690] 0 int x; [L722] 0 pthread_t t1, t2; [L723] EXPR 0 0<=turn [L723] EXPR 0 0<=turn && turn<=1 [L723] EXPR 0 turn<=1 [L723] EXPR 0 0<=turn && turn<=1 [L723] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) [L723] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L724] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [_={0:0}, flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=-2, t1={3:0}, t2={5:0}, turn=0, x=0] [L692] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L693] 1 flag2 >= 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L725] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [_={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=-1, t1={3:0}, t2={5:0}, turn=0, x=0] [L707] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, flag1=1, flag2 = 1=49, flag2=1, turn=0, x=0] [L693] 1 flag2 >= 1 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, flag1=1, flag2 = 1=49, flag2=1, turn=0, x=0] Now there is a data race on ~flag2~0 between C: flag2 = 1 [707] and C: flag2 >= 1 [693] - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 302 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 534 IncrementalHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 26 mSDtfsCounter, 534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=339occurred in iteration=6, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 55 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-31 11:27:09,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE