./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/goblint-regression/28-race_reach_76-tricky_address3_racefree.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 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 03:00:13,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 03:00:13,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 03:00:13,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 03:00:13,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 03:00:13,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 03:00:13,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 03:00:13,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 03:00:13,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 03:00:13,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 03:00:13,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 03:00:13,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 03:00:13,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 03:00:13,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 03:00:13,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 03:00:13,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 03:00:13,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 03:00:13,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 03:00:13,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 03:00:13,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 03:00:13,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 03:00:13,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 03:00:13,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 03:00:13,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 03:00:13,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 03:00:13,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 03:00:13,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 03:00:13,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 03:00:13,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 03:00:13,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 03:00:13,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 03:00:13,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 03:00:13,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 03:00:13,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 03:00:13,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 03:00:13,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 03:00:13,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 03:00:13,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 03:00:13,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 03:00:13,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 03:00:13,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 03:00:13,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-29 03:00:13,453 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 03:00:13,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 03:00:13,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 03:00:13,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 03:00:13,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 03:00:13,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 03:00:13,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 03:00:13,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 03:00:13,455 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 03:00:13,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 03:00:13,455 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 03:00:13,455 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 03:00:13,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 03:00:13,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 03:00:13,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 03:00:13,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 03:00:13,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 03:00:13,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 03:00:13,456 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 03:00:13,456 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 03:00:13,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 03:00:13,457 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 03:00:13,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 03:00:13,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 03:00:13,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 03:00:13,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 03:00:13,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 03:00:13,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 03:00:13,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 03:00:13,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 03:00:13,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 03:00:13,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 03:00:13,458 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 03:00:13,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 03:00:13,459 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 03:00:13,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 03:00:13,459 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 03:00:13,459 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 -> 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 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 -> AFTER [2023-08-29 03:00:13,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 03:00:13,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 03:00:13,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 03:00:13,783 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 03:00:13,784 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 03:00:13,785 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-08-29 03:00:14,718 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 03:00:14,958 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 03:00:14,959 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-08-29 03:00:14,973 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c826b22/bfd8a35abee048919a25982519df4cc4/FLAG5b705cf6e [2023-08-29 03:00:14,985 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c826b22/bfd8a35abee048919a25982519df4cc4 [2023-08-29 03:00:14,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 03:00:14,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 03:00:14,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 03:00:14,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 03:00:14,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 03:00:14,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 03:00:14" (1/1) ... [2023-08-29 03:00:14,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59377325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:14, skipping insertion in model container [2023-08-29 03:00:14,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 03:00:14" (1/1) ... [2023-08-29 03:00:15,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 03:00:15,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 03:00:15,382 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-08-29 03:00:15,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 03:00:15,433 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 03:00:15,506 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-08-29 03:00:15,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 03:00:15,582 INFO L208 MainTranslator]: Completed translation [2023-08-29 03:00:15,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:15 WrapperNode [2023-08-29 03:00:15,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 03:00:15,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 03:00:15,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 03:00:15,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 03:00:15,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:15" (1/1) ... [2023-08-29 03:00:15,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:15" (1/1) ... [2023-08-29 03:00:15,646 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 256 [2023-08-29 03:00:15,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 03:00:15,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 03:00:15,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 03:00:15,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 03:00:15,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:15" (1/1) ... [2023-08-29 03:00:15,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:15" (1/1) ... [2023-08-29 03:00:15,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:15" (1/1) ... [2023-08-29 03:00:15,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:15" (1/1) ... [2023-08-29 03:00:15,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:15" (1/1) ... [2023-08-29 03:00:15,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:15" (1/1) ... [2023-08-29 03:00:15,675 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:15" (1/1) ... [2023-08-29 03:00:15,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:15" (1/1) ... [2023-08-29 03:00:15,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 03:00:15,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 03:00:15,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 03:00:15,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 03:00:15,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:15" (1/1) ... [2023-08-29 03:00:15,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 03:00:15,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:15,708 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-29 03:00:15,715 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-29 03:00:15,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 03:00:15,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 03:00:15,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 03:00:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 03:00:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 03:00:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 03:00:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 03:00:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 03:00:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 03:00:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 03:00:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 03:00:15,742 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 03:00:15,848 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 03:00:15,850 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 03:00:16,192 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 03:00:16,198 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 03:00:16,199 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-29 03:00:16,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:00:16 BoogieIcfgContainer [2023-08-29 03:00:16,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 03:00:16,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 03:00:16,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 03:00:16,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 03:00:16,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 03:00:14" (1/3) ... [2023-08-29 03:00:16,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4baa3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 03:00:16, skipping insertion in model container [2023-08-29 03:00:16,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:00:15" (2/3) ... [2023-08-29 03:00:16,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4baa3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 03:00:16, skipping insertion in model container [2023-08-29 03:00:16,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:00:16" (3/3) ... [2023-08-29 03:00:16,218 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2023-08-29 03:00:16,223 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 03:00:16,229 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 03:00:16,229 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 03:00:16,229 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 03:00:16,283 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 03:00:16,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:16,406 INFO L130 PetriNetUnfolder]: 45/374 cut-off events. [2023-08-29 03:00:16,406 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-29 03:00:16,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 374 events. 45/374 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1491 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-29 03:00:16,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:16,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:16,428 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:00:16,441 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:16,444 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:16,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:16,501 INFO L130 PetriNetUnfolder]: 45/374 cut-off events. [2023-08-29 03:00:16,502 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-29 03:00:16,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 374 events. 45/374 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1491 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-29 03:00:16,514 INFO L119 LiptonReduction]: Number of co-enabled transitions 23920 [2023-08-29 03:00:18,929 INFO L134 LiptonReduction]: Checked pairs total: 95023 [2023-08-29 03:00:18,929 INFO L136 LiptonReduction]: Total number of compositions: 163 [2023-08-29 03:00:18,943 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 03:00:18,949 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;@52a725c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:00:18,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 03:00:18,955 INFO L130 PetriNetUnfolder]: 14/76 cut-off events. [2023-08-29 03:00:18,955 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:00:18,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:18,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:18,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:18,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash -120121625, now seen corresponding path program 1 times [2023-08-29 03:00:18,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:18,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313743894] [2023-08-29 03:00:18,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:18,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:19,151 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-29 03:00:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313743894] [2023-08-29 03:00:19,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313743894] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:19,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:00:19,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:00:19,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870540126] [2023-08-29 03:00:19,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:19,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:00:19,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:19,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:00:19,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:00:19,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 428 [2023-08-29 03:00:19,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 132 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-29 03:00:19,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:19,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 428 [2023-08-29 03:00:19,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:19,409 INFO L130 PetriNetUnfolder]: 399/1539 cut-off events. [2023-08-29 03:00:19,409 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2023-08-29 03:00:19,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 1539 events. 399/1539 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10819 event pairs, 357 based on Foata normal form. 160/1537 useless extension candidates. Maximal degree in co-relation 2226. Up to 779 conditions per place. [2023-08-29 03:00:19,414 INFO L137 encePairwiseOnDemand]: 404/428 looper letters, 43 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2023-08-29 03:00:19,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 322 flow [2023-08-29 03:00:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:00:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:00:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2023-08-29 03:00:19,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.589563862928349 [2023-08-29 03:00:19,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 757 transitions. [2023-08-29 03:00:19,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 757 transitions. [2023-08-29 03:00:19,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:19,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 757 transitions. [2023-08-29 03:00:19,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 0 states have call successors, (0), 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-29 03:00:19,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 428.0) internal successors, (1712), 4 states have internal predecessors, (1712), 0 states have call successors, (0), 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-29 03:00:19,445 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 428.0) internal successors, (1712), 4 states have internal predecessors, (1712), 0 states have call successors, (0), 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-29 03:00:19,446 INFO L175 Difference]: Start difference. First operand has 110 places, 132 transitions, 272 flow. Second operand 3 states and 757 transitions. [2023-08-29 03:00:19,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 112 transitions, 322 flow [2023-08-29 03:00:19,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 322 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:00:19,451 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 242 flow [2023-08-29 03:00:19,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=113, PETRI_TRANSITIONS=112} [2023-08-29 03:00:19,455 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 3 predicate places. [2023-08-29 03:00:19,455 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 242 flow [2023-08-29 03:00:19,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-29 03:00:19,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:19,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:19,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 03:00:19,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:19,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:19,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1887140359, now seen corresponding path program 1 times [2023-08-29 03:00:19,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:19,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679648894] [2023-08-29 03:00:19,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:19,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:19,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:19,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679648894] [2023-08-29 03:00:19,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679648894] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:19,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634725998] [2023-08-29 03:00:19,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:19,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:19,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:19,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:19,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-29 03:00:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:19,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-29 03:00:19,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 03:00:19,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 03:00:19,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634725998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:19,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 03:00:19,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-29 03:00:19,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923735769] [2023-08-29 03:00:19,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:19,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:00:19,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:19,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:00:19,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 03:00:19,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 428 [2023-08-29 03:00:19,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 112 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 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-29 03:00:19,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:19,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 428 [2023-08-29 03:00:19,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:19,922 INFO L130 PetriNetUnfolder]: 397/1518 cut-off events. [2023-08-29 03:00:19,922 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 03:00:19,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2297 conditions, 1518 events. 397/1518 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10722 event pairs, 280 based on Foata normal form. 0/1365 useless extension candidates. Maximal degree in co-relation 2285. Up to 743 conditions per place. [2023-08-29 03:00:19,930 INFO L137 encePairwiseOnDemand]: 425/428 looper letters, 61 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2023-08-29 03:00:19,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 130 transitions, 404 flow [2023-08-29 03:00:19,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:00:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:00:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2023-08-29 03:00:19,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5864485981308412 [2023-08-29 03:00:19,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 753 transitions. [2023-08-29 03:00:19,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 753 transitions. [2023-08-29 03:00:19,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:19,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 753 transitions. [2023-08-29 03:00:19,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 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-29 03:00:19,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 428.0) internal successors, (1712), 4 states have internal predecessors, (1712), 0 states have call successors, (0), 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-29 03:00:19,937 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 428.0) internal successors, (1712), 4 states have internal predecessors, (1712), 0 states have call successors, (0), 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-29 03:00:19,937 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 242 flow. Second operand 3 states and 753 transitions. [2023-08-29 03:00:19,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 130 transitions, 404 flow [2023-08-29 03:00:19,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 130 transitions, 400 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 03:00:19,941 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 246 flow [2023-08-29 03:00:19,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2023-08-29 03:00:19,942 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 5 predicate places. [2023-08-29 03:00:19,942 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 246 flow [2023-08-29 03:00:19,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 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-29 03:00:19,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:19,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:19,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:20,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:20,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:20,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash -528961199, now seen corresponding path program 1 times [2023-08-29 03:00:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:20,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864630560] [2023-08-29 03:00:20,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:20,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:20,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:20,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864630560] [2023-08-29 03:00:20,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864630560] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:20,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921683917] [2023-08-29 03:00:20,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:20,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:20,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:20,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:20,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-29 03:00:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:20,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 03:00:20,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:20,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:00:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:20,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921683917] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:00:20,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:00:20,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 03:00:20,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227819988] [2023-08-29 03:00:20,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:00:20,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 03:00:20,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:20,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 03:00:20,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 03:00:20,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 428 [2023-08-29 03:00:20,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 230.85714285714286) internal successors, (1616), 7 states have internal predecessors, (1616), 0 states have call successors, (0), 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-29 03:00:20,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:20,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 428 [2023-08-29 03:00:20,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:20,536 INFO L130 PetriNetUnfolder]: 397/1508 cut-off events. [2023-08-29 03:00:20,537 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-08-29 03:00:20,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2344 conditions, 1508 events. 397/1508 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10588 event pairs, 357 based on Foata normal form. 3/1367 useless extension candidates. Maximal degree in co-relation 2317. Up to 762 conditions per place. [2023-08-29 03:00:20,542 INFO L137 encePairwiseOnDemand]: 425/428 looper letters, 43 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2023-08-29 03:00:20,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 115 transitions, 354 flow [2023-08-29 03:00:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:00:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:00:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1425 transitions. [2023-08-29 03:00:20,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5549065420560748 [2023-08-29 03:00:20,545 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1425 transitions. [2023-08-29 03:00:20,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1425 transitions. [2023-08-29 03:00:20,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:20,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1425 transitions. [2023-08-29 03:00:20,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 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-29 03:00:20,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 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-29 03:00:20,552 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 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-29 03:00:20,553 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 246 flow. Second operand 6 states and 1425 transitions. [2023-08-29 03:00:20,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 115 transitions, 354 flow [2023-08-29 03:00:20,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 115 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 03:00:20,557 INFO L231 Difference]: Finished difference. Result has 121 places, 115 transitions, 278 flow [2023-08-29 03:00:20,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=121, PETRI_TRANSITIONS=115} [2023-08-29 03:00:20,558 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 11 predicate places. [2023-08-29 03:00:20,558 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 115 transitions, 278 flow [2023-08-29 03:00:20,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.85714285714286) internal successors, (1616), 7 states have internal predecessors, (1616), 0 states have call successors, (0), 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-29 03:00:20,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:20,559 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:20,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:20,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-29 03:00:20,766 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:20,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:20,767 INFO L85 PathProgramCache]: Analyzing trace with hash -481369795, now seen corresponding path program 2 times [2023-08-29 03:00:20,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:20,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928500595] [2023-08-29 03:00:20,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:20,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:20,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:20,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928500595] [2023-08-29 03:00:20,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928500595] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:20,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430448104] [2023-08-29 03:00:20,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 03:00:20,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:20,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:20,895 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:20,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-29 03:00:20,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 03:00:20,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 03:00:20,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 03:00:20,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:21,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 03:00:21,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-29 03:00:21,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 03:00:21,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-08-29 03:00:21,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 03:00:21,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-08-29 03:00:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 03:00:21,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 03:00:21,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430448104] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:21,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 03:00:21,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-08-29 03:00:21,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813055817] [2023-08-29 03:00:21,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:21,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:00:21,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:21,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:00:21,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-29 03:00:21,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 428 [2023-08-29 03:00:21,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 115 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 199.16666666666666) internal successors, (1195), 6 states have internal predecessors, (1195), 0 states have call successors, (0), 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-29 03:00:21,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:21,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 428 [2023-08-29 03:00:21,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:21,749 INFO L130 PetriNetUnfolder]: 1379/3481 cut-off events. [2023-08-29 03:00:21,749 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-08-29 03:00:21,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6399 conditions, 3481 events. 1379/3481 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 23681 event pairs, 538 based on Foata normal form. 0/3212 useless extension candidates. Maximal degree in co-relation 6364. Up to 1860 conditions per place. [2023-08-29 03:00:21,761 INFO L137 encePairwiseOnDemand]: 400/428 looper letters, 156 selfloop transitions, 49 changer transitions 0/243 dead transitions. [2023-08-29 03:00:21,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 243 transitions, 959 flow [2023-08-29 03:00:21,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:00:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:00:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1386 transitions. [2023-08-29 03:00:21,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5397196261682243 [2023-08-29 03:00:21,764 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1386 transitions. [2023-08-29 03:00:21,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1386 transitions. [2023-08-29 03:00:21,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:21,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1386 transitions. [2023-08-29 03:00:21,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 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-29 03:00:21,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 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-29 03:00:21,771 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 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-29 03:00:21,771 INFO L175 Difference]: Start difference. First operand has 121 places, 115 transitions, 278 flow. Second operand 6 states and 1386 transitions. [2023-08-29 03:00:21,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 243 transitions, 959 flow [2023-08-29 03:00:21,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 243 transitions, 945 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 03:00:21,775 INFO L231 Difference]: Finished difference. Result has 130 places, 161 transitions, 602 flow [2023-08-29 03:00:21,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=602, PETRI_PLACES=130, PETRI_TRANSITIONS=161} [2023-08-29 03:00:21,776 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 20 predicate places. [2023-08-29 03:00:21,776 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 161 transitions, 602 flow [2023-08-29 03:00:21,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.16666666666666) internal successors, (1195), 6 states have internal predecessors, (1195), 0 states have call successors, (0), 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-29 03:00:21,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:21,777 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:21,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:21,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:21,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:21,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash 998356130, now seen corresponding path program 1 times [2023-08-29 03:00:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:21,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514530580] [2023-08-29 03:00:21,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:21,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 03:00:22,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:22,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514530580] [2023-08-29 03:00:22,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514530580] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:22,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156686791] [2023-08-29 03:00:22,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:22,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:22,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:22,029 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:22,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-29 03:00:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:22,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 03:00:22,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 03:00:22,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:00:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 03:00:22,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156686791] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:00:22,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:00:22,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-29 03:00:22,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661788107] [2023-08-29 03:00:22,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:00:22,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 03:00:22,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:22,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 03:00:22,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-29 03:00:22,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 428 [2023-08-29 03:00:22,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 161 transitions, 602 flow. Second operand has 14 states, 14 states have (on average 227.78571428571428) internal successors, (3189), 14 states have internal predecessors, (3189), 0 states have call successors, (0), 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-29 03:00:22,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:22,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 428 [2023-08-29 03:00:22,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:22,329 INFO L130 PetriNetUnfolder]: 37/188 cut-off events. [2023-08-29 03:00:22,329 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2023-08-29 03:00:22,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 188 events. 37/188 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 486 event pairs, 15 based on Foata normal form. 25/210 useless extension candidates. Maximal degree in co-relation 393. Up to 74 conditions per place. [2023-08-29 03:00:22,330 INFO L137 encePairwiseOnDemand]: 423/428 looper letters, 24 selfloop transitions, 13 changer transitions 20/79 dead transitions. [2023-08-29 03:00:22,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 79 transitions, 385 flow [2023-08-29 03:00:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-29 03:00:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-29 03:00:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3222 transitions. [2023-08-29 03:00:22,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.537716955941255 [2023-08-29 03:00:22,336 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3222 transitions. [2023-08-29 03:00:22,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3222 transitions. [2023-08-29 03:00:22,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:22,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3222 transitions. [2023-08-29 03:00:22,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 230.14285714285714) internal successors, (3222), 14 states have internal predecessors, (3222), 0 states have call successors, (0), 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-29 03:00:22,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 428.0) internal successors, (6420), 15 states have internal predecessors, (6420), 0 states have call successors, (0), 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-29 03:00:22,348 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 428.0) internal successors, (6420), 15 states have internal predecessors, (6420), 0 states have call successors, (0), 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-29 03:00:22,348 INFO L175 Difference]: Start difference. First operand has 130 places, 161 transitions, 602 flow. Second operand 14 states and 3222 transitions. [2023-08-29 03:00:22,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 79 transitions, 385 flow [2023-08-29 03:00:22,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 311 flow, removed 4 selfloop flow, removed 11 redundant places. [2023-08-29 03:00:22,352 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 175 flow [2023-08-29 03:00:22,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=175, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2023-08-29 03:00:22,353 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, -36 predicate places. [2023-08-29 03:00:22,354 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 175 flow [2023-08-29 03:00:22,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 227.78571428571428) internal successors, (3189), 14 states have internal predecessors, (3189), 0 states have call successors, (0), 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-29 03:00:22,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:22,355 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:22,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:22,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:22,560 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:22,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:22,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1472942479, now seen corresponding path program 1 times [2023-08-29 03:00:22,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:22,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931563411] [2023-08-29 03:00:22,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:22,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:00:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931563411] [2023-08-29 03:00:22,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931563411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:22,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:00:22,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:00:22,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247298713] [2023-08-29 03:00:22,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:22,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:00:22,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:22,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:00:22,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:00:23,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 428 [2023-08-29 03:00:23,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 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-29 03:00:23,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:23,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 428 [2023-08-29 03:00:23,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:23,083 INFO L130 PetriNetUnfolder]: 53/161 cut-off events. [2023-08-29 03:00:23,083 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-29 03:00:23,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 161 events. 53/161 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 246 event pairs, 42 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 320. Up to 123 conditions per place. [2023-08-29 03:00:23,084 INFO L137 encePairwiseOnDemand]: 422/428 looper letters, 45 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-08-29 03:00:23,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 55 transitions, 297 flow [2023-08-29 03:00:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:00:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:00:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1127 transitions. [2023-08-29 03:00:23,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43886292834890966 [2023-08-29 03:00:23,088 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1127 transitions. [2023-08-29 03:00:23,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1127 transitions. [2023-08-29 03:00:23,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:23,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1127 transitions. [2023-08-29 03:00:23,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 0 states have call successors, (0), 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-29 03:00:23,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 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-29 03:00:23,094 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 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-29 03:00:23,094 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 175 flow. Second operand 6 states and 1127 transitions. [2023-08-29 03:00:23,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 55 transitions, 297 flow [2023-08-29 03:00:23,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 225 flow, removed 24 selfloop flow, removed 10 redundant places. [2023-08-29 03:00:23,095 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 115 flow [2023-08-29 03:00:23,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-29 03:00:23,096 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, -54 predicate places. [2023-08-29 03:00:23,096 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 115 flow [2023-08-29 03:00:23,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 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-29 03:00:23,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:23,097 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:23,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 03:00:23,097 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-29 03:00:23,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:23,097 INFO L85 PathProgramCache]: Analyzing trace with hash -662430115, now seen corresponding path program 1 times [2023-08-29 03:00:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:23,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688243633] [2023-08-29 03:00:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:00:23,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:23,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688243633] [2023-08-29 03:00:23,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688243633] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:23,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:00:23,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:00:23,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158381275] [2023-08-29 03:00:23,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:23,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:00:23,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:23,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:00:23,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:00:23,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 428 [2023-08-29 03:00:23,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 186.33333333333334) internal successors, (1118), 6 states have internal predecessors, (1118), 0 states have call successors, (0), 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-29 03:00:23,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:23,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 428 [2023-08-29 03:00:23,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:23,598 INFO L130 PetriNetUnfolder]: 53/158 cut-off events. [2023-08-29 03:00:23,598 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:00:23,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 158 events. 53/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 240 event pairs, 44 based on Foata normal form. 3/160 useless extension candidates. Maximal degree in co-relation 315. Up to 128 conditions per place. [2023-08-29 03:00:23,598 INFO L137 encePairwiseOnDemand]: 423/428 looper letters, 0 selfloop transitions, 0 changer transitions 54/54 dead transitions. [2023-08-29 03:00:23,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 233 flow [2023-08-29 03:00:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:00:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:00:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1127 transitions. [2023-08-29 03:00:23,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43886292834890966 [2023-08-29 03:00:23,601 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1127 transitions. [2023-08-29 03:00:23,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1127 transitions. [2023-08-29 03:00:23,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:23,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1127 transitions. [2023-08-29 03:00:23,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 0 states have call successors, (0), 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-29 03:00:23,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 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-29 03:00:23,606 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 428.0) internal successors, (2996), 7 states have internal predecessors, (2996), 0 states have call successors, (0), 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-29 03:00:23,606 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 115 flow. Second operand 6 states and 1127 transitions. [2023-08-29 03:00:23,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 233 flow [2023-08-29 03:00:23,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 223 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 03:00:23,607 INFO L231 Difference]: Finished difference. Result has 55 places, 0 transitions, 0 flow [2023-08-29 03:00:23,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=55, PETRI_TRANSITIONS=0} [2023-08-29 03:00:23,608 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, -55 predicate places. [2023-08-29 03:00:23,608 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 0 transitions, 0 flow [2023-08-29 03:00:23,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.33333333333334) internal successors, (1118), 6 states have internal predecessors, (1118), 0 states have call successors, (0), 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-29 03:00:23,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2023-08-29 03:00:23,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2023-08-29 03:00:23,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2023-08-29 03:00:23,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2023-08-29 03:00:23,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2023-08-29 03:00:23,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2023-08-29 03:00:23,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2023-08-29 03:00:23,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2023-08-29 03:00:23,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2023-08-29 03:00:23,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2023-08-29 03:00:23,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2023-08-29 03:00:23,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2023-08-29 03:00:23,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2023-08-29 03:00:23,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2023-08-29 03:00:23,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2023-08-29 03:00:23,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2023-08-29 03:00:23,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 03:00:23,613 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-08-29 03:00:23,614 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 03:00:23,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:23,637 INFO L130 PetriNetUnfolder]: 45/374 cut-off events. [2023-08-29 03:00:23,637 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-29 03:00:23,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 374 events. 45/374 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1491 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-29 03:00:23,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 265 transitions, 538 flow [2023-08-29 03:00:23,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 260 transitions, 525 flow [2023-08-29 03:00:23,640 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:00:23,641 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 260 transitions, 525 flow [2023-08-29 03:00:23,641 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 260 transitions, 525 flow [2023-08-29 03:00:23,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 260 transitions, 525 flow [2023-08-29 03:00:23,659 INFO L130 PetriNetUnfolder]: 44/369 cut-off events. [2023-08-29 03:00:23,660 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:00:23,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 369 events. 44/369 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1419 event pairs, 0 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-29 03:00:23,668 INFO L119 LiptonReduction]: Number of co-enabled transitions 23920 [2023-08-29 03:00:25,820 INFO L134 LiptonReduction]: Checked pairs total: 94118 [2023-08-29 03:00:25,820 INFO L136 LiptonReduction]: Total number of compositions: 160 [2023-08-29 03:00:25,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 03:00:25,822 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;@52a725c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:00:25,822 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 03:00:25,824 INFO L130 PetriNetUnfolder]: 8/40 cut-off events. [2023-08-29 03:00:25,824 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:00:25,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:25,824 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-29 03:00:25,825 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:00:25,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:25,825 INFO L85 PathProgramCache]: Analyzing trace with hash 787742204, now seen corresponding path program 1 times [2023-08-29 03:00:25,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:25,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978059677] [2023-08-29 03:00:25,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:25,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:25,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:25,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978059677] [2023-08-29 03:00:25,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978059677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:25,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:00:25,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:00:25,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31844899] [2023-08-29 03:00:25,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:25,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:00:25,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:25,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:00:25,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:00:25,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 425 [2023-08-29 03:00:25,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 130 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-29 03:00:25,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:25,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 425 [2023-08-29 03:00:25,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:25,975 INFO L130 PetriNetUnfolder]: 380/1485 cut-off events. [2023-08-29 03:00:25,975 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:00:25,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 1485 events. 380/1485 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10383 event pairs, 340 based on Foata normal form. 156/1502 useless extension candidates. Maximal degree in co-relation 2140. Up to 741 conditions per place. [2023-08-29 03:00:25,978 INFO L137 encePairwiseOnDemand]: 400/425 looper letters, 23 selfloop transitions, 2 changer transitions 53/109 dead transitions. [2023-08-29 03:00:25,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 307 flow [2023-08-29 03:00:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:00:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:00:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2023-08-29 03:00:25,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.592156862745098 [2023-08-29 03:00:25,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 755 transitions. [2023-08-29 03:00:25,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 755 transitions. [2023-08-29 03:00:25,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:25,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 755 transitions. [2023-08-29 03:00:25,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 0 states have call successors, (0), 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-29 03:00:25,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 425.0) internal successors, (1700), 4 states have internal predecessors, (1700), 0 states have call successors, (0), 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-29 03:00:25,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 425.0) internal successors, (1700), 4 states have internal predecessors, (1700), 0 states have call successors, (0), 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-29 03:00:25,985 INFO L175 Difference]: Start difference. First operand has 109 places, 130 transitions, 265 flow. Second operand 3 states and 755 transitions. [2023-08-29 03:00:25,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 307 flow [2023-08-29 03:00:25,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 109 transitions, 307 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:00:25,987 INFO L231 Difference]: Finished difference. Result has 111 places, 56 transitions, 127 flow [2023-08-29 03:00:25,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=111, PETRI_TRANSITIONS=56} [2023-08-29 03:00:25,988 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 2 predicate places. [2023-08-29 03:00:25,988 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 56 transitions, 127 flow [2023-08-29 03:00:25,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 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-29 03:00:25,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:25,989 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:25,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 03:00:25,989 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:00:25,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1295383115, now seen corresponding path program 1 times [2023-08-29 03:00:25,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:25,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576426490] [2023-08-29 03:00:25,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:25,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:26,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:26,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576426490] [2023-08-29 03:00:26,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576426490] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:26,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960189861] [2023-08-29 03:00:26,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:26,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:26,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:26,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:26,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-29 03:00:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:26,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 03:00:26,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:26,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:00:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:26,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960189861] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:00:26,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:00:26,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 03:00:26,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822887403] [2023-08-29 03:00:26,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:00:26,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 03:00:26,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:26,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 03:00:26,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 03:00:26,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 425 [2023-08-29 03:00:26,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 56 transitions, 127 flow. Second operand has 7 states, 7 states have (on average 230.57142857142858) internal successors, (1614), 7 states have internal predecessors, (1614), 0 states have call successors, (0), 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-29 03:00:26,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:26,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 425 [2023-08-29 03:00:26,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:26,218 INFO L130 PetriNetUnfolder]: 56/254 cut-off events. [2023-08-29 03:00:26,218 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:00:26,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 254 events. 56/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 881 event pairs, 51 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 391. Up to 129 conditions per place. [2023-08-29 03:00:26,219 INFO L137 encePairwiseOnDemand]: 422/425 looper letters, 23 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-08-29 03:00:26,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 195 flow [2023-08-29 03:00:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:00:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:00:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1405 transitions. [2023-08-29 03:00:26,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5509803921568628 [2023-08-29 03:00:26,222 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1405 transitions. [2023-08-29 03:00:26,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1405 transitions. [2023-08-29 03:00:26,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:26,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1405 transitions. [2023-08-29 03:00:26,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 234.16666666666666) internal successors, (1405), 6 states have internal predecessors, (1405), 0 states have call successors, (0), 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-29 03:00:26,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 425.0) internal successors, (2975), 7 states have internal predecessors, (2975), 0 states have call successors, (0), 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-29 03:00:26,227 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 425.0) internal successors, (2975), 7 states have internal predecessors, (2975), 0 states have call successors, (0), 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-29 03:00:26,227 INFO L175 Difference]: Start difference. First operand has 111 places, 56 transitions, 127 flow. Second operand 6 states and 1405 transitions. [2023-08-29 03:00:26,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 195 flow [2023-08-29 03:00:26,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 191 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 03:00:26,237 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 159 flow [2023-08-29 03:00:26,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2023-08-29 03:00:26,238 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -43 predicate places. [2023-08-29 03:00:26,238 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 159 flow [2023-08-29 03:00:26,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.57142857142858) internal successors, (1614), 7 states have internal predecessors, (1614), 0 states have call successors, (0), 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-29 03:00:26,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:26,239 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-29 03:00:26,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-29 03:00:26,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:26,444 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:00:26,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:26,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2014618684, now seen corresponding path program 2 times [2023-08-29 03:00:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203744549] [2023-08-29 03:00:26,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:26,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:26,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203744549] [2023-08-29 03:00:26,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203744549] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:26,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915504514] [2023-08-29 03:00:26,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 03:00:26,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:26,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:26,515 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:26,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-29 03:00:26,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 03:00:26,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 03:00:26,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 03:00:26,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:26,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:00:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 03:00:26,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915504514] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:00:26,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:00:26,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 03:00:26,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437900142] [2023-08-29 03:00:26,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:00:26,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 03:00:26,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:26,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 03:00:26,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 03:00:26,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 425 [2023-08-29 03:00:26,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 159 flow. Second operand has 13 states, 13 states have (on average 230.30769230769232) internal successors, (2994), 13 states have internal predecessors, (2994), 0 states have call successors, (0), 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-29 03:00:26,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:26,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 425 [2023-08-29 03:00:26,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:26,751 INFO L130 PetriNetUnfolder]: 56/260 cut-off events. [2023-08-29 03:00:26,752 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-29 03:00:26,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 260 events. 56/260 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 881 event pairs, 51 based on Foata normal form. 6/235 useless extension candidates. Maximal degree in co-relation 382. Up to 129 conditions per place. [2023-08-29 03:00:26,753 INFO L137 encePairwiseOnDemand]: 422/425 looper letters, 23 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2023-08-29 03:00:26,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 65 transitions, 263 flow [2023-08-29 03:00:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 03:00:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 03:00:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2788 transitions. [2023-08-29 03:00:26,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2023-08-29 03:00:26,760 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2788 transitions. [2023-08-29 03:00:26,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2788 transitions. [2023-08-29 03:00:26,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:26,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2788 transitions. [2023-08-29 03:00:26,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 232.33333333333334) internal successors, (2788), 12 states have internal predecessors, (2788), 0 states have call successors, (0), 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-29 03:00:26,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 425.0) internal successors, (5525), 13 states have internal predecessors, (5525), 0 states have call successors, (0), 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-29 03:00:26,774 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 425.0) internal successors, (5525), 13 states have internal predecessors, (5525), 0 states have call successors, (0), 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-29 03:00:26,774 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 159 flow. Second operand 12 states and 2788 transitions. [2023-08-29 03:00:26,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 65 transitions, 263 flow [2023-08-29 03:00:26,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 65 transitions, 249 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 03:00:26,776 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 229 flow [2023-08-29 03:00:26,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=229, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2023-08-29 03:00:26,777 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -27 predicate places. [2023-08-29 03:00:26,777 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 229 flow [2023-08-29 03:00:26,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 230.30769230769232) internal successors, (2994), 13 states have internal predecessors, (2994), 0 states have call successors, (0), 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-29 03:00:26,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:26,778 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-29 03:00:26,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:26,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:26,984 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:00:26,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:26,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1570766436, now seen corresponding path program 3 times [2023-08-29 03:00:26,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:26,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383530601] [2023-08-29 03:00:26,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 03:00:27,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 03:00:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 03:00:27,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 03:00:27,028 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 03:00:27,028 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 03:00:27,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 03:00:27,028 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-29 03:00:27,029 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 03:00:27,029 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 03:00:27,029 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-29 03:00:27,061 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 03:00:27,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 371 transitions, 760 flow [2023-08-29 03:00:27,109 INFO L130 PetriNetUnfolder]: 75/619 cut-off events. [2023-08-29 03:00:27,110 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-29 03:00:27,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 619 events. 75/619 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3067 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 376. Up to 12 conditions per place. [2023-08-29 03:00:27,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 371 transitions, 760 flow [2023-08-29 03:00:27,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 331 places, 371 transitions, 760 flow [2023-08-29 03:00:27,123 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:00:27,123 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 331 places, 371 transitions, 760 flow [2023-08-29 03:00:27,123 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 331 places, 371 transitions, 760 flow [2023-08-29 03:00:27,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 371 transitions, 760 flow [2023-08-29 03:00:27,169 INFO L130 PetriNetUnfolder]: 75/619 cut-off events. [2023-08-29 03:00:27,169 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-29 03:00:27,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 619 events. 75/619 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3067 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 376. Up to 12 conditions per place. [2023-08-29 03:00:27,208 INFO L119 LiptonReduction]: Number of co-enabled transitions 71760 [2023-08-29 03:00:30,017 INFO L134 LiptonReduction]: Checked pairs total: 284693 [2023-08-29 03:00:30,018 INFO L136 LiptonReduction]: Total number of compositions: 220 [2023-08-29 03:00:30,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 03:00:30,019 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;@52a725c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:00:30,019 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-29 03:00:30,023 INFO L130 PetriNetUnfolder]: 15/86 cut-off events. [2023-08-29 03:00:30,023 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 03:00:30,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:30,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:30,023 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:00:30,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash 865883554, now seen corresponding path program 1 times [2023-08-29 03:00:30,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:30,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725847747] [2023-08-29 03:00:30,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:30,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:30,050 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-29 03:00:30,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:30,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725847747] [2023-08-29 03:00:30,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725847747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:30,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:00:30,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:00:30,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382808952] [2023-08-29 03:00:30,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:30,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:00:30,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:00:30,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:00:30,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 591 [2023-08-29 03:00:30,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 192 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:30,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:30,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 591 [2023-08-29 03:00:30,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:32,457 INFO L130 PetriNetUnfolder]: 14691/34824 cut-off events. [2023-08-29 03:00:32,457 INFO L131 PetriNetUnfolder]: For 206/254 co-relation queries the response was YES. [2023-08-29 03:00:32,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56201 conditions, 34824 events. 14691/34824 cut-off events. For 206/254 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 375543 event pairs, 13600 based on Foata normal form. 3905/35480 useless extension candidates. Maximal degree in co-relation 20590. Up to 21259 conditions per place. [2023-08-29 03:00:32,610 INFO L137 encePairwiseOnDemand]: 558/591 looper letters, 62 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2023-08-29 03:00:32,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 163 transitions, 472 flow [2023-08-29 03:00:32,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:00:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:00:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1058 transitions. [2023-08-29 03:00:32,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5967287084038353 [2023-08-29 03:00:32,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1058 transitions. [2023-08-29 03:00:32,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1058 transitions. [2023-08-29 03:00:32,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:32,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1058 transitions. [2023-08-29 03:00:32,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 352.6666666666667) internal successors, (1058), 3 states have internal predecessors, (1058), 0 states have call successors, (0), 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-29 03:00:32,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 591.0) internal successors, (2364), 4 states have internal predecessors, (2364), 0 states have call successors, (0), 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-29 03:00:32,617 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 591.0) internal successors, (2364), 4 states have internal predecessors, (2364), 0 states have call successors, (0), 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-29 03:00:32,617 INFO L175 Difference]: Start difference. First operand has 161 places, 192 transitions, 402 flow. Second operand 3 states and 1058 transitions. [2023-08-29 03:00:32,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 163 transitions, 472 flow [2023-08-29 03:00:32,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 163 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:00:32,620 INFO L231 Difference]: Finished difference. Result has 164 places, 163 transitions, 354 flow [2023-08-29 03:00:32,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=164, PETRI_TRANSITIONS=163} [2023-08-29 03:00:32,621 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 3 predicate places. [2023-08-29 03:00:32,621 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 163 transitions, 354 flow [2023-08-29 03:00:32,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:00:32,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:32,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:32,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 03:00:32,622 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:00:32,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1876810043, now seen corresponding path program 1 times [2023-08-29 03:00:32,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:32,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419626074] [2023-08-29 03:00:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:32,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:32,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419626074] [2023-08-29 03:00:32,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419626074] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:32,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583666462] [2023-08-29 03:00:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:32,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:32,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:32,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:32,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-29 03:00:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:32,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-29 03:00:32,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 03:00:32,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 03:00:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583666462] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:32,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 03:00:32,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-29 03:00:32,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747815932] [2023-08-29 03:00:32,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:32,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:00:32,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:32,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:00:32,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 03:00:32,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 591 [2023-08-29 03:00:32,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 163 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 0 states have call successors, (0), 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-29 03:00:32,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:32,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 591 [2023-08-29 03:00:32,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:35,024 INFO L130 PetriNetUnfolder]: 14345/35073 cut-off events. [2023-08-29 03:00:35,024 INFO L131 PetriNetUnfolder]: For 169/188 co-relation queries the response was YES. [2023-08-29 03:00:35,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56456 conditions, 35073 events. 14345/35073 cut-off events. For 169/188 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 388169 event pairs, 6494 based on Foata normal form. 0/31798 useless extension candidates. Maximal degree in co-relation 56443. Up to 21223 conditions per place. [2023-08-29 03:00:35,182 INFO L137 encePairwiseOnDemand]: 588/591 looper letters, 81 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2023-08-29 03:00:35,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 182 transitions, 558 flow [2023-08-29 03:00:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:00:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:00:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2023-08-29 03:00:35,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.589960518894529 [2023-08-29 03:00:35,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1046 transitions. [2023-08-29 03:00:35,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1046 transitions. [2023-08-29 03:00:35,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:35,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1046 transitions. [2023-08-29 03:00:35,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 348.6666666666667) internal successors, (1046), 3 states have internal predecessors, (1046), 0 states have call successors, (0), 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-29 03:00:35,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 591.0) internal successors, (2364), 4 states have internal predecessors, (2364), 0 states have call successors, (0), 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-29 03:00:35,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 591.0) internal successors, (2364), 4 states have internal predecessors, (2364), 0 states have call successors, (0), 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-29 03:00:35,189 INFO L175 Difference]: Start difference. First operand has 164 places, 163 transitions, 354 flow. Second operand 3 states and 1046 transitions. [2023-08-29 03:00:35,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 182 transitions, 558 flow [2023-08-29 03:00:35,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 182 transitions, 554 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 03:00:35,192 INFO L231 Difference]: Finished difference. Result has 166 places, 164 transitions, 362 flow [2023-08-29 03:00:35,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=166, PETRI_TRANSITIONS=164} [2023-08-29 03:00:35,192 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 5 predicate places. [2023-08-29 03:00:35,193 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 164 transitions, 362 flow [2023-08-29 03:00:35,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 0 states have call successors, (0), 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-29 03:00:35,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:35,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:35,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:35,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:35,398 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:00:35,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:35,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1345218897, now seen corresponding path program 1 times [2023-08-29 03:00:35,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:35,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786822849] [2023-08-29 03:00:35,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:35,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:35,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:35,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786822849] [2023-08-29 03:00:35,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786822849] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:35,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040143710] [2023-08-29 03:00:35,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:35,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:35,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:35,441 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:35,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-29 03:00:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:35,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 03:00:35,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:35,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:00:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:35,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040143710] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:00:35,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:00:35,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 03:00:35,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742850657] [2023-08-29 03:00:35,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:00:35,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 03:00:35,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:35,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 03:00:35,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 03:00:35,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 591 [2023-08-29 03:00:35,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 164 transitions, 362 flow. Second operand has 7 states, 7 states have (on average 321.85714285714283) internal successors, (2253), 7 states have internal predecessors, (2253), 0 states have call successors, (0), 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-29 03:00:35,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:35,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 591 [2023-08-29 03:00:35,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:38,050 INFO L130 PetriNetUnfolder]: 14723/35024 cut-off events. [2023-08-29 03:00:38,050 INFO L131 PetriNetUnfolder]: For 870/885 co-relation queries the response was YES. [2023-08-29 03:00:38,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57099 conditions, 35024 events. 14723/35024 cut-off events. For 870/885 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 378997 event pairs, 13600 based on Foata normal form. 3/32050 useless extension candidates. Maximal degree in co-relation 57071. Up to 21242 conditions per place. [2023-08-29 03:00:38,231 INFO L137 encePairwiseOnDemand]: 588/591 looper letters, 63 selfloop transitions, 5 changer transitions 0/167 dead transitions. [2023-08-29 03:00:38,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 167 transitions, 510 flow [2023-08-29 03:00:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:00:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:00:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1990 transitions. [2023-08-29 03:00:38,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5611957134799774 [2023-08-29 03:00:38,235 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1990 transitions. [2023-08-29 03:00:38,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1990 transitions. [2023-08-29 03:00:38,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:38,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1990 transitions. [2023-08-29 03:00:38,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 331.6666666666667) internal successors, (1990), 6 states have internal predecessors, (1990), 0 states have call successors, (0), 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-29 03:00:38,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:00:38,242 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:00:38,242 INFO L175 Difference]: Start difference. First operand has 166 places, 164 transitions, 362 flow. Second operand 6 states and 1990 transitions. [2023-08-29 03:00:38,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 167 transitions, 510 flow [2023-08-29 03:00:38,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 167 transitions, 508 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 03:00:38,245 INFO L231 Difference]: Finished difference. Result has 173 places, 167 transitions, 396 flow [2023-08-29 03:00:38,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=173, PETRI_TRANSITIONS=167} [2023-08-29 03:00:38,245 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 12 predicate places. [2023-08-29 03:00:38,246 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 167 transitions, 396 flow [2023-08-29 03:00:38,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 321.85714285714283) internal successors, (2253), 7 states have internal predecessors, (2253), 0 states have call successors, (0), 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-29 03:00:38,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:38,246 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:38,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-29 03:00:38,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-29 03:00:38,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:00:38,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:38,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1900216085, now seen corresponding path program 2 times [2023-08-29 03:00:38,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:38,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560030454] [2023-08-29 03:00:38,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:38,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:00:38,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:38,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560030454] [2023-08-29 03:00:38,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560030454] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:38,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704449675] [2023-08-29 03:00:38,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 03:00:38,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:38,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:38,517 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:38,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-29 03:00:38,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 03:00:38,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 03:00:38,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 03:00:38,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:38,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 03:00:38,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-29 03:00:38,628 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 03:00:38,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-08-29 03:00:38,646 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 03:00:38,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-08-29 03:00:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 03:00:38,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 03:00:38,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704449675] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:38,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 03:00:38,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-08-29 03:00:38,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453538671] [2023-08-29 03:00:38,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:38,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:00:38,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:38,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:00:38,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-29 03:00:39,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 591 [2023-08-29 03:00:39,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 167 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 282.1666666666667) internal successors, (1693), 6 states have internal predecessors, (1693), 0 states have call successors, (0), 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-29 03:00:39,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:39,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 591 [2023-08-29 03:00:39,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:48,197 INFO L130 PetriNetUnfolder]: 76027/132935 cut-off events. [2023-08-29 03:00:48,197 INFO L131 PetriNetUnfolder]: For 2956/2993 co-relation queries the response was YES. [2023-08-29 03:00:48,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249775 conditions, 132935 events. 76027/132935 cut-off events. For 2956/2993 co-relation queries the response was YES. Maximal size of possible extension queue 2620. Compared 1275025 event pairs, 38157 based on Foata normal form. 0/123401 useless extension candidates. Maximal degree in co-relation 249739. Up to 81883 conditions per place. [2023-08-29 03:00:48,901 INFO L137 encePairwiseOnDemand]: 555/591 looper letters, 260 selfloop transitions, 81 changer transitions 0/405 dead transitions. [2023-08-29 03:00:48,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 405 transitions, 1613 flow [2023-08-29 03:00:48,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:00:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:00:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2015 transitions. [2023-08-29 03:00:48,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5682459108855048 [2023-08-29 03:00:48,905 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2015 transitions. [2023-08-29 03:00:48,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2015 transitions. [2023-08-29 03:00:48,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:48,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2015 transitions. [2023-08-29 03:00:48,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 335.8333333333333) internal successors, (2015), 6 states have internal predecessors, (2015), 0 states have call successors, (0), 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-29 03:00:48,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:00:48,918 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:00:48,918 INFO L175 Difference]: Start difference. First operand has 173 places, 167 transitions, 396 flow. Second operand 6 states and 2015 transitions. [2023-08-29 03:00:48,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 405 transitions, 1613 flow [2023-08-29 03:00:48,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 405 transitions, 1599 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 03:00:48,926 INFO L231 Difference]: Finished difference. Result has 182 places, 245 transitions, 928 flow [2023-08-29 03:00:48,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=928, PETRI_PLACES=182, PETRI_TRANSITIONS=245} [2023-08-29 03:00:48,927 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 21 predicate places. [2023-08-29 03:00:48,927 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 245 transitions, 928 flow [2023-08-29 03:00:48,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.1666666666667) internal successors, (1693), 6 states have internal predecessors, (1693), 0 states have call successors, (0), 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-29 03:00:48,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:48,928 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:48,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-29 03:00:49,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-29 03:00:49,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:00:49,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2124113616, now seen corresponding path program 1 times [2023-08-29 03:00:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:49,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284256866] [2023-08-29 03:00:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:49,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 03:00:49,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:49,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284256866] [2023-08-29 03:00:49,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284256866] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:00:49,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116180344] [2023-08-29 03:00:49,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:49,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:00:49,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:00:49,189 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:00:49,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-29 03:00:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:49,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 03:00:49,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:00:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 03:00:49,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:00:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 03:00:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116180344] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:00:49,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:00:49,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-29 03:00:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621994187] [2023-08-29 03:00:49,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:00:49,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 03:00:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:49,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 03:00:49,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-29 03:00:49,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 591 [2023-08-29 03:00:49,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 245 transitions, 928 flow. Second operand has 14 states, 14 states have (on average 318.7857142857143) internal successors, (4463), 14 states have internal predecessors, (4463), 0 states have call successors, (0), 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-29 03:00:49,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:49,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 591 [2023-08-29 03:00:49,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:00:52,113 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1))) (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [533#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), 271#L958-4true, Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 301#L945-16true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:52,113 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 03:00:52,113 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:00:52,113 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:00:52,113 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:00:52,114 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1))) (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [533#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 180#ULTIMATE.startEXITtrue, 301#L945-16true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:52,114 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 03:00:52,114 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:00:52,114 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:00:52,114 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 03:00:52,761 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1))) (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [533#true, 213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), 271#L958-4true, Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:52,761 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:00:52,761 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:00:52,761 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:00:52,761 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:00:52,762 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1))) (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [533#true, 213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:52,762 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2023-08-29 03:00:52,762 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:00:52,762 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:00:52,762 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:00:52,890 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1))) (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [533#true, 79#L945-47true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), 271#L958-4true, Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:52,891 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:00:52,891 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:00:52,891 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:00:52,891 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:00:52,891 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1))) (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [533#true, 79#L945-47true, t_funThread1of2ForFork0InUse, 215#L945-21true, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:52,891 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2023-08-29 03:00:52,891 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:00:52,891 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:00:52,891 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:00:53,018 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1))) (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [533#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), 271#L958-4true, Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:53,018 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-29 03:00:53,018 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:00:53,018 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:00:53,018 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:00:53,019 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1))) (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [533#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 180#ULTIMATE.startEXITtrue, 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:53,019 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2023-08-29 03:00:53,019 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:00:53,019 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:00:53,019 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-08-29 03:00:54,362 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][259], [533#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), 271#L958-4true, Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 301#L945-16true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:54,363 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2023-08-29 03:00:54,363 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-08-29 03:00:54,363 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-08-29 03:00:54,363 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-08-29 03:00:54,363 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][259], [533#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 301#L945-16true, 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:54,363 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2023-08-29 03:00:54,363 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-08-29 03:00:54,363 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-08-29 03:00:54,363 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-08-29 03:00:54,855 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][259], [533#true, 213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), 271#L958-4true, Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:54,855 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-29 03:00:54,855 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:00:54,855 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:00:54,855 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:00:54,856 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][259], [533#true, 213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:54,856 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-29 03:00:54,856 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:00:54,856 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:00:54,856 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:00:54,966 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][259], [533#true, 79#L945-47true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), 271#L958-4true, Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:54,966 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-29 03:00:54,966 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:00:54,966 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:00:54,966 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:00:54,967 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][259], [533#true, 79#L945-47true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:54,967 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-29 03:00:54,967 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:00:54,967 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:00:54,967 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:00:55,075 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][259], [533#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), 271#L958-4true, Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:55,075 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-29 03:00:55,075 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-29 03:00:55,076 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-29 03:00:55,076 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-29 03:00:55,076 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][259], [533#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 221#L945-28true, 180#ULTIMATE.startEXITtrue, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:55,076 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-29 03:00:55,077 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-29 03:00:55,077 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-29 03:00:55,077 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-29 03:00:55,663 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1))) (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [533#true, 213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, 87#L958-14true, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:55,663 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2023-08-29 03:00:55,663 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:00:55,663 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:00:55,663 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-08-29 03:00:55,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1))) (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [533#true, 79#L945-47true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, 87#L958-14true, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:55,741 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2023-08-29 03:00:55,741 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:00:55,741 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:00:55,741 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-08-29 03:00:55,808 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1605] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_229| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1))) (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|))) InVars {#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_229|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][149], [533#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 215#L945-21true, 87#L958-14true, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:55,809 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2023-08-29 03:00:55,809 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:00:55,809 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:00:55,809 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-08-29 03:00:56,404 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][259], [533#true, 213#L945-22true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 87#L958-14true, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:56,405 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2023-08-29 03:00:56,405 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-29 03:00:56,405 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-29 03:00:56,405 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-29 03:00:56,421 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][259], [533#true, 79#L945-47true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 87#L958-14true, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), 227#L945-45true, Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:56,421 INFO L383 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2023-08-29 03:00:56,421 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:00:56,421 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:00:56,421 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 03:00:56,436 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1710] L945-41-->L945-45: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet42#1_26|) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) (= |v_t_funThread2of2ForFork0_#t~nondet42#1_26| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~nondet42#1=|v_t_funThread2of2ForFork0_#t~nondet42#1_26|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem40#1=|v_t_funThread2of2ForFork0_#t~mem40#1_13|, t_funThread2of2ForFork0_#t~post41#1=|v_t_funThread2of2ForFork0_#t~post41#1_13|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~nondet42#1, t_funThread2of2ForFork0_#t~mem40#1, t_funThread2of2ForFork0_#t~post41#1][259], [533#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 87#L958-14true, Black: 526#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 522#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 382#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 518#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 336#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 463#(< |ULTIMATE.start_main_~i~1#1| 9), 227#L945-45true, Black: 459#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 514#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 221#L945-28true, Black: 352#(<= |ULTIMATE.start_main_~i~3#1| 0), 468#true, 379#true]) [2023-08-29 03:00:56,436 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2023-08-29 03:00:56,436 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:00:56,436 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:00:56,436 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 03:00:56,508 INFO L130 PetriNetUnfolder]: 34697/83396 cut-off events. [2023-08-29 03:00:56,509 INFO L131 PetriNetUnfolder]: For 17563/24245 co-relation queries the response was YES. [2023-08-29 03:00:56,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165532 conditions, 83396 events. 34697/83396 cut-off events. For 17563/24245 co-relation queries the response was YES. Maximal size of possible extension queue 1996. Compared 1010283 event pairs, 3122 based on Foata normal form. 753/76800 useless extension candidates. Maximal degree in co-relation 165474. Up to 42917 conditions per place. [2023-08-29 03:00:57,003 INFO L137 encePairwiseOnDemand]: 586/591 looper letters, 137 selfloop transitions, 14 changer transitions 0/312 dead transitions. [2023-08-29 03:00:57,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 312 transitions, 1440 flow [2023-08-29 03:00:57,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-29 03:00:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-29 03:00:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4572 transitions. [2023-08-29 03:00:57,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5525743292240755 [2023-08-29 03:00:57,012 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 4572 transitions. [2023-08-29 03:00:57,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 4572 transitions. [2023-08-29 03:00:57,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:00:57,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 4572 transitions. [2023-08-29 03:00:57,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 326.57142857142856) internal successors, (4572), 14 states have internal predecessors, (4572), 0 states have call successors, (0), 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-29 03:00:57,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 591.0) internal successors, (8865), 15 states have internal predecessors, (8865), 0 states have call successors, (0), 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-29 03:00:57,026 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 591.0) internal successors, (8865), 15 states have internal predecessors, (8865), 0 states have call successors, (0), 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-29 03:00:57,027 INFO L175 Difference]: Start difference. First operand has 182 places, 245 transitions, 928 flow. Second operand 14 states and 4572 transitions. [2023-08-29 03:00:57,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 312 transitions, 1440 flow [2023-08-29 03:00:57,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 312 transitions, 1440 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:00:57,139 INFO L231 Difference]: Finished difference. Result has 196 places, 251 transitions, 998 flow [2023-08-29 03:00:57,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=998, PETRI_PLACES=196, PETRI_TRANSITIONS=251} [2023-08-29 03:00:57,140 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 35 predicate places. [2023-08-29 03:00:57,140 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 251 transitions, 998 flow [2023-08-29 03:00:57,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 318.7857142857143) internal successors, (4463), 14 states have internal predecessors, (4463), 0 states have call successors, (0), 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-29 03:00:57,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:00:57,141 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:00:57,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-29 03:00:57,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-29 03:00:57,342 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:00:57,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:00:57,342 INFO L85 PathProgramCache]: Analyzing trace with hash -634595861, now seen corresponding path program 1 times [2023-08-29 03:00:57,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:00:57,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97091173] [2023-08-29 03:00:57,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:00:57,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:00:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:00:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-29 03:00:57,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:00:57,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97091173] [2023-08-29 03:00:57,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97091173] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:00:57,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:00:57,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:00:57,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457312676] [2023-08-29 03:00:57,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:00:57,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:00:57,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:00:57,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:00:57,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:00:58,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 591 [2023-08-29 03:00:58,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 251 transitions, 998 flow. Second operand has 6 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 0 states have call successors, (0), 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-29 03:00:58,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:00:58,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 591 [2023-08-29 03:00:58,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:01:15,960 INFO L130 PetriNetUnfolder]: 121455/215587 cut-off events. [2023-08-29 03:01:15,960 INFO L131 PetriNetUnfolder]: For 77323/81389 co-relation queries the response was YES. [2023-08-29 03:01:16,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493744 conditions, 215587 events. 121455/215587 cut-off events. For 77323/81389 co-relation queries the response was YES. Maximal size of possible extension queue 4313. Compared 2216937 event pairs, 46865 based on Foata normal form. 1756/202731 useless extension candidates. Maximal degree in co-relation 493672. Up to 130828 conditions per place. [2023-08-29 03:01:17,780 INFO L137 encePairwiseOnDemand]: 555/591 looper letters, 341 selfloop transitions, 225 changer transitions 0/638 dead transitions. [2023-08-29 03:01:17,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 638 transitions, 3687 flow [2023-08-29 03:01:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:01:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:01:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2013 transitions. [2023-08-29 03:01:17,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5676818950930627 [2023-08-29 03:01:17,785 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2013 transitions. [2023-08-29 03:01:17,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2013 transitions. [2023-08-29 03:01:17,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:01:17,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2013 transitions. [2023-08-29 03:01:17,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 335.5) internal successors, (2013), 6 states have internal predecessors, (2013), 0 states have call successors, (0), 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-29 03:01:17,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:01:17,792 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:01:17,793 INFO L175 Difference]: Start difference. First operand has 196 places, 251 transitions, 998 flow. Second operand 6 states and 2013 transitions. [2023-08-29 03:01:17,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 638 transitions, 3687 flow [2023-08-29 03:01:18,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 638 transitions, 3609 flow, removed 29 selfloop flow, removed 10 redundant places. [2023-08-29 03:01:18,223 INFO L231 Difference]: Finished difference. Result has 196 places, 473 transitions, 3082 flow [2023-08-29 03:01:18,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3082, PETRI_PLACES=196, PETRI_TRANSITIONS=473} [2023-08-29 03:01:18,223 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 35 predicate places. [2023-08-29 03:01:18,224 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 473 transitions, 3082 flow [2023-08-29 03:01:18,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 0 states have call successors, (0), 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-29 03:01:18,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:01:18,224 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:01:18,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 03:01:18,224 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:01:18,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:01:18,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1531199328, now seen corresponding path program 1 times [2023-08-29 03:01:18,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:01:18,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031068226] [2023-08-29 03:01:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:18,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:01:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:01:18,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:01:18,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031068226] [2023-08-29 03:01:18,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031068226] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:01:18,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673212442] [2023-08-29 03:01:18,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:18,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:01:18,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:01:18,280 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:01:18,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-29 03:01:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:18,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 03:01:18,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:01:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:01:18,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:01:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:01:18,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673212442] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:01:18,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:01:18,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-29 03:01:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362989578] [2023-08-29 03:01:18,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:01:18,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 03:01:18,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:01:18,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 03:01:18,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-08-29 03:01:18,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 591 [2023-08-29 03:01:18,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 473 transitions, 3082 flow. Second operand has 9 states, 9 states have (on average 322.6666666666667) internal successors, (2904), 9 states have internal predecessors, (2904), 0 states have call successors, (0), 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-29 03:01:18,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:01:18,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 591 [2023-08-29 03:01:18,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:01:19,372 INFO L130 PetriNetUnfolder]: 4219/10083 cut-off events. [2023-08-29 03:01:19,372 INFO L131 PetriNetUnfolder]: For 7950/8180 co-relation queries the response was YES. [2023-08-29 03:01:19,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25895 conditions, 10083 events. 4219/10083 cut-off events. For 7950/8180 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 87667 event pairs, 1459 based on Foata normal form. 847/10620 useless extension candidates. Maximal degree in co-relation 19275. Up to 3987 conditions per place. [2023-08-29 03:01:19,426 INFO L137 encePairwiseOnDemand]: 588/591 looper letters, 148 selfloop transitions, 3 changer transitions 0/298 dead transitions. [2023-08-29 03:01:19,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 298 transitions, 1758 flow [2023-08-29 03:01:19,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 03:01:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 03:01:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1696 transitions. [2023-08-29 03:01:19,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5739424703891709 [2023-08-29 03:01:19,428 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1696 transitions. [2023-08-29 03:01:19,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1696 transitions. [2023-08-29 03:01:19,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:01:19,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1696 transitions. [2023-08-29 03:01:19,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 339.2) internal successors, (1696), 5 states have internal predecessors, (1696), 0 states have call successors, (0), 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-29 03:01:19,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 591.0) internal successors, (3546), 6 states have internal predecessors, (3546), 0 states have call successors, (0), 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-29 03:01:19,433 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 591.0) internal successors, (3546), 6 states have internal predecessors, (3546), 0 states have call successors, (0), 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-29 03:01:19,433 INFO L175 Difference]: Start difference. First operand has 196 places, 473 transitions, 3082 flow. Second operand 5 states and 1696 transitions. [2023-08-29 03:01:19,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 298 transitions, 1758 flow [2023-08-29 03:01:19,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 298 transitions, 1752 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 03:01:19,455 INFO L231 Difference]: Finished difference. Result has 142 places, 222 transitions, 1130 flow [2023-08-29 03:01:19,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1130, PETRI_PLACES=142, PETRI_TRANSITIONS=222} [2023-08-29 03:01:19,455 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -19 predicate places. [2023-08-29 03:01:19,455 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 222 transitions, 1130 flow [2023-08-29 03:01:19,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 322.6666666666667) internal successors, (2904), 9 states have internal predecessors, (2904), 0 states have call successors, (0), 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-29 03:01:19,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:01:19,456 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:01:19,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-29 03:01:19,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-29 03:01:19,662 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:01:19,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:01:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1663368514, now seen corresponding path program 1 times [2023-08-29 03:01:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:01:19,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415845604] [2023-08-29 03:01:19,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:19,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:01:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:01:19,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:01:19,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415845604] [2023-08-29 03:01:19,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415845604] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:01:19,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:01:19,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:01:19,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695022195] [2023-08-29 03:01:19,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:01:19,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:01:19,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:01:19,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:01:19,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:01:20,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 591 [2023-08-29 03:01:20,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 222 transitions, 1130 flow. Second operand has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:01:20,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:01:20,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 591 [2023-08-29 03:01:20,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:01:21,833 INFO L130 PetriNetUnfolder]: 11562/20063 cut-off events. [2023-08-29 03:01:21,834 INFO L131 PetriNetUnfolder]: For 18467/18665 co-relation queries the response was YES. [2023-08-29 03:01:21,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58965 conditions, 20063 events. 11562/20063 cut-off events. For 18467/18665 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 141621 event pairs, 7653 based on Foata normal form. 0/19657 useless extension candidates. Maximal degree in co-relation 44136. Up to 16935 conditions per place. [2023-08-29 03:01:22,074 INFO L137 encePairwiseOnDemand]: 564/591 looper letters, 270 selfloop transitions, 115 changer transitions 0/409 dead transitions. [2023-08-29 03:01:22,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 409 transitions, 2664 flow [2023-08-29 03:01:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:01:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:01:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2023-08-29 03:01:22,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4946418499717992 [2023-08-29 03:01:22,080 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1754 transitions. [2023-08-29 03:01:22,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1754 transitions. [2023-08-29 03:01:22,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:01:22,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1754 transitions. [2023-08-29 03:01:22,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 292.3333333333333) internal successors, (1754), 6 states have internal predecessors, (1754), 0 states have call successors, (0), 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-29 03:01:22,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:01:22,086 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:01:22,086 INFO L175 Difference]: Start difference. First operand has 142 places, 222 transitions, 1130 flow. Second operand 6 states and 1754 transitions. [2023-08-29 03:01:22,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 409 transitions, 2664 flow [2023-08-29 03:01:22,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 409 transitions, 2647 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 03:01:22,135 INFO L231 Difference]: Finished difference. Result has 149 places, 327 transitions, 2177 flow [2023-08-29 03:01:22,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2177, PETRI_PLACES=149, PETRI_TRANSITIONS=327} [2023-08-29 03:01:22,136 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -12 predicate places. [2023-08-29 03:01:22,136 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 327 transitions, 2177 flow [2023-08-29 03:01:22,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:01:22,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:01:22,136 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:01:22,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 03:01:22,137 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:01:22,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:01:22,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1869216497, now seen corresponding path program 1 times [2023-08-29 03:01:22,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:01:22,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399240934] [2023-08-29 03:01:22,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:22,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:01:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-29 03:01:22,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:01:22,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399240934] [2023-08-29 03:01:22,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399240934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:01:22,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:01:22,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:01:22,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394053169] [2023-08-29 03:01:22,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:01:22,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:01:22,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:01:22,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:01:22,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:01:22,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 591 [2023-08-29 03:01:22,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 327 transitions, 2177 flow. Second operand has 6 states, 6 states have (on average 255.5) internal successors, (1533), 6 states have internal predecessors, (1533), 0 states have call successors, (0), 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-29 03:01:22,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:01:22,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 591 [2023-08-29 03:01:22,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:01:24,939 INFO L130 PetriNetUnfolder]: 12794/21958 cut-off events. [2023-08-29 03:01:24,939 INFO L131 PetriNetUnfolder]: For 22428/22710 co-relation queries the response was YES. [2023-08-29 03:01:24,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71293 conditions, 21958 events. 12794/21958 cut-off events. For 22428/22710 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 156527 event pairs, 8160 based on Foata normal form. 0/21539 useless extension candidates. Maximal degree in co-relation 54084. Up to 18960 conditions per place. [2023-08-29 03:01:25,049 INFO L137 encePairwiseOnDemand]: 564/591 looper letters, 367 selfloop transitions, 129 changer transitions 0/518 dead transitions. [2023-08-29 03:01:25,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 518 transitions, 4059 flow [2023-08-29 03:01:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:01:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:01:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1751 transitions. [2023-08-29 03:01:25,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49379582628313595 [2023-08-29 03:01:25,052 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1751 transitions. [2023-08-29 03:01:25,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1751 transitions. [2023-08-29 03:01:25,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:01:25,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1751 transitions. [2023-08-29 03:01:25,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 291.8333333333333) internal successors, (1751), 6 states have internal predecessors, (1751), 0 states have call successors, (0), 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-29 03:01:25,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:01:25,057 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:01:25,058 INFO L175 Difference]: Start difference. First operand has 149 places, 327 transitions, 2177 flow. Second operand 6 states and 1751 transitions. [2023-08-29 03:01:25,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 518 transitions, 4059 flow [2023-08-29 03:01:25,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 518 transitions, 3919 flow, removed 70 selfloop flow, removed 0 redundant places. [2023-08-29 03:01:25,161 INFO L231 Difference]: Finished difference. Result has 159 places, 438 transitions, 3267 flow [2023-08-29 03:01:25,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3267, PETRI_PLACES=159, PETRI_TRANSITIONS=438} [2023-08-29 03:01:25,162 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -2 predicate places. [2023-08-29 03:01:25,162 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 438 transitions, 3267 flow [2023-08-29 03:01:25,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.5) internal successors, (1533), 6 states have internal predecessors, (1533), 0 states have call successors, (0), 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-29 03:01:25,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:01:25,163 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:01:25,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 03:01:25,163 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:01:25,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:01:25,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1854585078, now seen corresponding path program 1 times [2023-08-29 03:01:25,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:01:25,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908766170] [2023-08-29 03:01:25,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:25,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:01:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 03:01:25,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:01:25,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908766170] [2023-08-29 03:01:25,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908766170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:01:25,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:01:25,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 03:01:25,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943757405] [2023-08-29 03:01:25,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:01:25,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 03:01:25,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:01:25,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 03:01:25,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 03:01:25,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 591 [2023-08-29 03:01:25,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 438 transitions, 3267 flow. Second operand has 5 states, 5 states have (on average 305.4) internal successors, (1527), 5 states have internal predecessors, (1527), 0 states have call successors, (0), 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-29 03:01:25,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:01:25,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 591 [2023-08-29 03:01:25,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:01:26,051 INFO L130 PetriNetUnfolder]: 1257/3662 cut-off events. [2023-08-29 03:01:26,051 INFO L131 PetriNetUnfolder]: For 3009/3009 co-relation queries the response was YES. [2023-08-29 03:01:26,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10828 conditions, 3662 events. 1257/3662 cut-off events. For 3009/3009 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 27173 event pairs, 442 based on Foata normal form. 207/3742 useless extension candidates. Maximal degree in co-relation 7095. Up to 1318 conditions per place. [2023-08-29 03:01:26,064 INFO L137 encePairwiseOnDemand]: 576/591 looper letters, 70 selfloop transitions, 15 changer transitions 9/147 dead transitions. [2023-08-29 03:01:26,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 147 transitions, 895 flow [2023-08-29 03:01:26,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 03:01:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 03:01:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1292 transitions. [2023-08-29 03:01:26,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5465313028764806 [2023-08-29 03:01:26,066 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1292 transitions. [2023-08-29 03:01:26,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1292 transitions. [2023-08-29 03:01:26,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:01:26,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1292 transitions. [2023-08-29 03:01:26,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 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-29 03:01:26,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 591.0) internal successors, (2955), 5 states have internal predecessors, (2955), 0 states have call successors, (0), 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-29 03:01:26,069 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 591.0) internal successors, (2955), 5 states have internal predecessors, (2955), 0 states have call successors, (0), 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-29 03:01:26,069 INFO L175 Difference]: Start difference. First operand has 159 places, 438 transitions, 3267 flow. Second operand 4 states and 1292 transitions. [2023-08-29 03:01:26,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 147 transitions, 895 flow [2023-08-29 03:01:26,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 147 transitions, 597 flow, removed 69 selfloop flow, removed 34 redundant places. [2023-08-29 03:01:26,101 INFO L231 Difference]: Finished difference. Result has 121 places, 114 transitions, 363 flow [2023-08-29 03:01:26,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=121, PETRI_TRANSITIONS=114} [2023-08-29 03:01:26,101 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -40 predicate places. [2023-08-29 03:01:26,101 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 114 transitions, 363 flow [2023-08-29 03:01:26,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 305.4) internal successors, (1527), 5 states have internal predecessors, (1527), 0 states have call successors, (0), 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-29 03:01:26,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:01:26,102 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:01:26,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 03:01:26,102 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:01:26,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:01:26,103 INFO L85 PathProgramCache]: Analyzing trace with hash -264043872, now seen corresponding path program 1 times [2023-08-29 03:01:26,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:01:26,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327903014] [2023-08-29 03:01:26,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:26,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:01:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 03:01:26,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:01:26,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327903014] [2023-08-29 03:01:26,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327903014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:01:26,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:01:26,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:01:26,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179112921] [2023-08-29 03:01:26,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:01:26,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:01:26,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:01:26,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:01:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:01:26,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 591 [2023-08-29 03:01:26,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 114 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 257.1666666666667) internal successors, (1543), 6 states have internal predecessors, (1543), 0 states have call successors, (0), 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-29 03:01:26,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:01:26,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 591 [2023-08-29 03:01:26,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:01:26,955 INFO L130 PetriNetUnfolder]: 2557/5109 cut-off events. [2023-08-29 03:01:26,956 INFO L131 PetriNetUnfolder]: For 2101/2107 co-relation queries the response was YES. [2023-08-29 03:01:26,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13446 conditions, 5109 events. 2557/5109 cut-off events. For 2101/2107 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 31985 event pairs, 2310 based on Foata normal form. 0/4864 useless extension candidates. Maximal degree in co-relation 4521. Up to 4455 conditions per place. [2023-08-29 03:01:26,975 INFO L137 encePairwiseOnDemand]: 585/591 looper letters, 104 selfloop transitions, 5 changer transitions 22/145 dead transitions. [2023-08-29 03:01:26,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 145 transitions, 737 flow [2023-08-29 03:01:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:01:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:01:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1620 transitions. [2023-08-29 03:01:26,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45685279187817257 [2023-08-29 03:01:26,978 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1620 transitions. [2023-08-29 03:01:26,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1620 transitions. [2023-08-29 03:01:26,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:01:26,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1620 transitions. [2023-08-29 03:01:26,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 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-29 03:01:26,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:01:26,982 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:01:26,983 INFO L175 Difference]: Start difference. First operand has 121 places, 114 transitions, 363 flow. Second operand 6 states and 1620 transitions. [2023-08-29 03:01:26,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 145 transitions, 737 flow [2023-08-29 03:01:26,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 145 transitions, 718 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 03:01:26,990 INFO L231 Difference]: Finished difference. Result has 122 places, 99 transitions, 301 flow [2023-08-29 03:01:26,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=122, PETRI_TRANSITIONS=99} [2023-08-29 03:01:26,990 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -39 predicate places. [2023-08-29 03:01:26,990 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 99 transitions, 301 flow [2023-08-29 03:01:26,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.1666666666667) internal successors, (1543), 6 states have internal predecessors, (1543), 0 states have call successors, (0), 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-29 03:01:26,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:01:26,991 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:01:26,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 03:01:26,991 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-29 03:01:26,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:01:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2023345242, now seen corresponding path program 1 times [2023-08-29 03:01:26,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:01:26,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588848574] [2023-08-29 03:01:26,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:26,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:01:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-29 03:01:27,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:01:27,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588848574] [2023-08-29 03:01:27,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588848574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:01:27,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:01:27,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:01:27,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845604045] [2023-08-29 03:01:27,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:01:27,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:01:27,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:01:27,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:01:27,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:01:27,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 591 [2023-08-29 03:01:27,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 99 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 257.6666666666667) internal successors, (1546), 6 states have internal predecessors, (1546), 0 states have call successors, (0), 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-29 03:01:27,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:01:27,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 591 [2023-08-29 03:01:27,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:01:27,779 INFO L130 PetriNetUnfolder]: 1618/3264 cut-off events. [2023-08-29 03:01:27,779 INFO L131 PetriNetUnfolder]: For 1051/1051 co-relation queries the response was YES. [2023-08-29 03:01:27,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8433 conditions, 3264 events. 1618/3264 cut-off events. For 1051/1051 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 18228 event pairs, 1461 based on Foata normal form. 0/3166 useless extension candidates. Maximal degree in co-relation 6932. Up to 2841 conditions per place. [2023-08-29 03:01:27,785 INFO L137 encePairwiseOnDemand]: 585/591 looper letters, 0 selfloop transitions, 0 changer transitions 122/122 dead transitions. [2023-08-29 03:01:27,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 122 transitions, 591 flow [2023-08-29 03:01:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:01:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:01:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1608 transitions. [2023-08-29 03:01:27,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45346869712351945 [2023-08-29 03:01:27,787 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1608 transitions. [2023-08-29 03:01:27,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1608 transitions. [2023-08-29 03:01:27,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:01:27,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1608 transitions. [2023-08-29 03:01:27,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 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-29 03:01:27,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:01:27,792 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 591.0) internal successors, (4137), 7 states have internal predecessors, (4137), 0 states have call successors, (0), 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-29 03:01:27,792 INFO L175 Difference]: Start difference. First operand has 122 places, 99 transitions, 301 flow. Second operand 6 states and 1608 transitions. [2023-08-29 03:01:27,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 122 transitions, 591 flow [2023-08-29 03:01:27,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 122 transitions, 565 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-29 03:01:27,795 INFO L231 Difference]: Finished difference. Result has 110 places, 0 transitions, 0 flow [2023-08-29 03:01:27,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=110, PETRI_TRANSITIONS=0} [2023-08-29 03:01:27,796 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -51 predicate places. [2023-08-29 03:01:27,796 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 0 transitions, 0 flow [2023-08-29 03:01:27,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.6666666666667) internal successors, (1546), 6 states have internal predecessors, (1546), 0 states have call successors, (0), 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-29 03:01:27,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (20 of 21 remaining) [2023-08-29 03:01:27,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2023-08-29 03:01:27,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2023-08-29 03:01:27,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2023-08-29 03:01:27,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2023-08-29 03:01:27,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2023-08-29 03:01:27,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2023-08-29 03:01:27,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2023-08-29 03:01:27,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2023-08-29 03:01:27,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2023-08-29 03:01:27,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2023-08-29 03:01:27,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2023-08-29 03:01:27,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2023-08-29 03:01:27,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2023-08-29 03:01:27,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2023-08-29 03:01:27,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2023-08-29 03:01:27,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2023-08-29 03:01:27,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2023-08-29 03:01:27,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2023-08-29 03:01:27,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2023-08-29 03:01:27,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2023-08-29 03:01:27,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 03:01:27,800 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:01:27,801 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 03:01:27,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 371 transitions, 760 flow [2023-08-29 03:01:27,856 INFO L130 PetriNetUnfolder]: 75/619 cut-off events. [2023-08-29 03:01:27,856 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-29 03:01:27,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 619 events. 75/619 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3067 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 376. Up to 12 conditions per place. [2023-08-29 03:01:27,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 371 transitions, 760 flow [2023-08-29 03:01:27,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 331 places, 371 transitions, 760 flow [2023-08-29 03:01:27,864 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:01:27,864 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 331 places, 371 transitions, 760 flow [2023-08-29 03:01:27,864 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 331 places, 371 transitions, 760 flow [2023-08-29 03:01:27,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 371 transitions, 760 flow [2023-08-29 03:01:27,909 INFO L130 PetriNetUnfolder]: 75/619 cut-off events. [2023-08-29 03:01:27,910 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-29 03:01:27,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 619 events. 75/619 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3067 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 376. Up to 12 conditions per place. [2023-08-29 03:01:27,931 INFO L119 LiptonReduction]: Number of co-enabled transitions 71760 [2023-08-29 03:01:30,633 INFO L134 LiptonReduction]: Checked pairs total: 284627 [2023-08-29 03:01:30,634 INFO L136 LiptonReduction]: Total number of compositions: 223 [2023-08-29 03:01:30,635 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 03:01:30,635 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;@52a725c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:01:30,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 03:01:30,639 INFO L130 PetriNetUnfolder]: 22/114 cut-off events. [2023-08-29 03:01:30,639 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 03:01:30,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:01:30,640 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-29 03:01:30,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:01:30,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:01:30,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1583915580, now seen corresponding path program 1 times [2023-08-29 03:01:30,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:01:30,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465192258] [2023-08-29 03:01:30,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:30,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:01:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:01:30,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:01:30,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465192258] [2023-08-29 03:01:30,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465192258] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:01:30,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:01:30,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:01:30,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531137076] [2023-08-29 03:01:30,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:01:30,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:01:30,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:01:30,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:01:30,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:01:30,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 594 [2023-08-29 03:01:30,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 194 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 0 states have call successors, (0), 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-29 03:01:30,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:01:30,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 594 [2023-08-29 03:01:30,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:01:32,402 INFO L130 PetriNetUnfolder]: 14691/34824 cut-off events. [2023-08-29 03:01:32,402 INFO L131 PetriNetUnfolder]: For 206/254 co-relation queries the response was YES. [2023-08-29 03:01:32,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56201 conditions, 34824 events. 14691/34824 cut-off events. For 206/254 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 375579 event pairs, 13600 based on Foata normal form. 4492/36067 useless extension candidates. Maximal degree in co-relation 20590. Up to 21259 conditions per place. [2023-08-29 03:01:32,488 INFO L137 encePairwiseOnDemand]: 559/594 looper letters, 41 selfloop transitions, 2 changer transitions 58/163 dead transitions. [2023-08-29 03:01:32,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 163 transitions, 472 flow [2023-08-29 03:01:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:01:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:01:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2023-08-29 03:01:32,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5948372615039281 [2023-08-29 03:01:32,489 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1060 transitions. [2023-08-29 03:01:32,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1060 transitions. [2023-08-29 03:01:32,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:01:32,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1060 transitions. [2023-08-29 03:01:32,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 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-29 03:01:32,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 594.0) internal successors, (2376), 4 states have internal predecessors, (2376), 0 states have call successors, (0), 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-29 03:01:32,491 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 594.0) internal successors, (2376), 4 states have internal predecessors, (2376), 0 states have call successors, (0), 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-29 03:01:32,492 INFO L175 Difference]: Start difference. First operand has 161 places, 194 transitions, 406 flow. Second operand 3 states and 1060 transitions. [2023-08-29 03:01:32,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 163 transitions, 472 flow [2023-08-29 03:01:32,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 163 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:01:32,494 INFO L231 Difference]: Finished difference. Result has 164 places, 105 transitions, 232 flow [2023-08-29 03:01:32,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=594, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=164, PETRI_TRANSITIONS=105} [2023-08-29 03:01:32,494 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, 3 predicate places. [2023-08-29 03:01:32,494 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 105 transitions, 232 flow [2023-08-29 03:01:32,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 0 states have call successors, (0), 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-29 03:01:32,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:01:32,494 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 03:01:32,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 03:01:32,495 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:01:32,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:01:32,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2037448912, now seen corresponding path program 1 times [2023-08-29 03:01:32,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:01:32,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115320044] [2023-08-29 03:01:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:01:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:01:32,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:01:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115320044] [2023-08-29 03:01:32,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115320044] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:01:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974916835] [2023-08-29 03:01:32,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:32,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:01:32,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:01:32,524 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:01:32,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-29 03:01:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:32,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 03:01:32,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:01:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:01:32,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:01:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:01:32,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974916835] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:01:32,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:01:32,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 03:01:32,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948115608] [2023-08-29 03:01:32,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:01:32,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 03:01:32,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:01:32,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 03:01:32,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 03:01:32,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 594 [2023-08-29 03:01:32,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 105 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 321.7142857142857) internal successors, (2252), 7 states have internal predecessors, (2252), 0 states have call successors, (0), 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-29 03:01:32,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:01:32,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 594 [2023-08-29 03:01:32,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:01:32,970 INFO L130 PetriNetUnfolder]: 2338/5891 cut-off events. [2023-08-29 03:01:32,970 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2023-08-29 03:01:32,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 5891 events. 2338/5891 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 48258 event pairs, 2193 based on Foata normal form. 0/5246 useless extension candidates. Maximal degree in co-relation 9538. Up to 3567 conditions per place. [2023-08-29 03:01:32,985 INFO L137 encePairwiseOnDemand]: 591/594 looper letters, 41 selfloop transitions, 5 changer transitions 0/108 dead transitions. [2023-08-29 03:01:32,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 108 transitions, 336 flow [2023-08-29 03:01:32,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:01:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:01:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1969 transitions. [2023-08-29 03:01:32,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5524691358024691 [2023-08-29 03:01:32,987 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1969 transitions. [2023-08-29 03:01:32,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1969 transitions. [2023-08-29 03:01:32,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:01:32,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1969 transitions. [2023-08-29 03:01:32,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 328.1666666666667) internal successors, (1969), 6 states have internal predecessors, (1969), 0 states have call successors, (0), 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-29 03:01:32,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 594.0) internal successors, (4158), 7 states have internal predecessors, (4158), 0 states have call successors, (0), 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-29 03:01:32,991 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 594.0) internal successors, (4158), 7 states have internal predecessors, (4158), 0 states have call successors, (0), 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-29 03:01:32,991 INFO L175 Difference]: Start difference. First operand has 164 places, 105 transitions, 232 flow. Second operand 6 states and 1969 transitions. [2023-08-29 03:01:32,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 108 transitions, 336 flow [2023-08-29 03:01:32,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 108 transitions, 330 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-29 03:01:32,992 INFO L231 Difference]: Finished difference. Result has 116 places, 108 transitions, 262 flow [2023-08-29 03:01:32,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=594, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=116, PETRI_TRANSITIONS=108} [2023-08-29 03:01:32,993 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -45 predicate places. [2023-08-29 03:01:32,993 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 108 transitions, 262 flow [2023-08-29 03:01:32,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 321.7142857142857) internal successors, (2252), 7 states have internal predecessors, (2252), 0 states have call successors, (0), 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-29 03:01:32,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:01:32,993 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-29 03:01:32,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-29 03:01:33,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-29 03:01:33,194 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:01:33,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:01:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash 215328572, now seen corresponding path program 2 times [2023-08-29 03:01:33,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:01:33,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99234245] [2023-08-29 03:01:33,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:33,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:01:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:01:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:01:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99234245] [2023-08-29 03:01:33,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99234245] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 03:01:33,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580348172] [2023-08-29 03:01:33,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 03:01:33,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 03:01:33,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:01:33,243 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 03:01:33,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-29 03:01:33,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 03:01:33,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 03:01:33,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 03:01:33,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 03:01:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:01:33,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 03:01:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 03:01:33,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580348172] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 03:01:33,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 03:01:33,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 03:01:33,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302817685] [2023-08-29 03:01:33,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 03:01:33,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 03:01:33,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:01:33,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 03:01:33,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 03:01:33,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 594 [2023-08-29 03:01:33,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 262 flow. Second operand has 13 states, 13 states have (on average 321.38461538461536) internal successors, (4178), 13 states have internal predecessors, (4178), 0 states have call successors, (0), 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-29 03:01:33,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:01:33,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 594 [2023-08-29 03:01:33,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:01:33,755 INFO L130 PetriNetUnfolder]: 2338/5897 cut-off events. [2023-08-29 03:01:33,756 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2023-08-29 03:01:33,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9578 conditions, 5897 events. 2338/5897 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 48271 event pairs, 2193 based on Foata normal form. 6/5259 useless extension candidates. Maximal degree in co-relation 9519. Up to 3567 conditions per place. [2023-08-29 03:01:33,773 INFO L137 encePairwiseOnDemand]: 591/594 looper letters, 41 selfloop transitions, 11 changer transitions 0/114 dead transitions. [2023-08-29 03:01:33,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 114 transitions, 402 flow [2023-08-29 03:01:33,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 03:01:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 03:01:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3898 transitions. [2023-08-29 03:01:33,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5468574635241302 [2023-08-29 03:01:33,776 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3898 transitions. [2023-08-29 03:01:33,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3898 transitions. [2023-08-29 03:01:33,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:01:33,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3898 transitions. [2023-08-29 03:01:33,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 324.8333333333333) internal successors, (3898), 12 states have internal predecessors, (3898), 0 states have call successors, (0), 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-29 03:01:33,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 594.0) internal successors, (7722), 13 states have internal predecessors, (7722), 0 states have call successors, (0), 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-29 03:01:33,783 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 594.0) internal successors, (7722), 13 states have internal predecessors, (7722), 0 states have call successors, (0), 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-29 03:01:33,783 INFO L175 Difference]: Start difference. First operand has 116 places, 108 transitions, 262 flow. Second operand 12 states and 3898 transitions. [2023-08-29 03:01:33,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 114 transitions, 402 flow [2023-08-29 03:01:33,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 114 transitions, 388 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 03:01:33,785 INFO L231 Difference]: Finished difference. Result has 132 places, 114 transitions, 332 flow [2023-08-29 03:01:33,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=594, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=332, PETRI_PLACES=132, PETRI_TRANSITIONS=114} [2023-08-29 03:01:33,785 INFO L281 CegarLoopForPetriNet]: 161 programPoint places, -29 predicate places. [2023-08-29 03:01:33,785 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 114 transitions, 332 flow [2023-08-29 03:01:33,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 321.38461538461536) internal successors, (4178), 13 states have internal predecessors, (4178), 0 states have call successors, (0), 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-29 03:01:33,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:01:33,786 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-29 03:01:33,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-29 03:01:33,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-29 03:01:33,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 03:01:33,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:01:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1854504636, now seen corresponding path program 3 times [2023-08-29 03:01:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:01:33,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122095483] [2023-08-29 03:01:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:01:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 03:01:34,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 03:01:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 03:01:34,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 03:01:34,046 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 03:01:34,046 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 03:01:34,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 03:01:34,047 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-29 03:01:34,047 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 03:01:34,047 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 03:01:34,048 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-29 03:01:34,076 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-29 03:01:34,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 425 places, 477 transitions, 984 flow [2023-08-29 03:01:34,177 INFO L130 PetriNetUnfolder]: 110/907 cut-off events. [2023-08-29 03:01:34,177 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2023-08-29 03:01:34,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 907 events. 110/907 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4958 event pairs, 1 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 627. Up to 16 conditions per place. [2023-08-29 03:01:34,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 425 places, 477 transitions, 984 flow [2023-08-29 03:01:34,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 425 places, 477 transitions, 984 flow [2023-08-29 03:01:34,198 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:01:34,198 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 425 places, 477 transitions, 984 flow [2023-08-29 03:01:34,199 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 425 places, 477 transitions, 984 flow [2023-08-29 03:01:34,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 425 places, 477 transitions, 984 flow [2023-08-29 03:01:34,299 INFO L130 PetriNetUnfolder]: 110/907 cut-off events. [2023-08-29 03:01:34,299 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2023-08-29 03:01:34,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 907 events. 110/907 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4958 event pairs, 1 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 627. Up to 16 conditions per place. [2023-08-29 03:01:34,355 INFO L119 LiptonReduction]: Number of co-enabled transitions 141024 [2023-08-29 03:01:37,700 INFO L134 LiptonReduction]: Checked pairs total: 570703 [2023-08-29 03:01:37,700 INFO L136 LiptonReduction]: Total number of compositions: 291 [2023-08-29 03:01:37,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 03:01:37,701 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;@52a725c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:01:37,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-29 03:01:37,704 INFO L130 PetriNetUnfolder]: 14/73 cut-off events. [2023-08-29 03:01:37,704 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 03:01:37,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:01:37,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:01:37,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-08-29 03:01:37,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:01:37,705 INFO L85 PathProgramCache]: Analyzing trace with hash 518680513, now seen corresponding path program 1 times [2023-08-29 03:01:37,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:01:37,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135804338] [2023-08-29 03:01:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:01:37,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:01:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:01:37,718 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-29 03:01:37,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:01:37,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135804338] [2023-08-29 03:01:37,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135804338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:01:37,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:01:37,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:01:37,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526549157] [2023-08-29 03:01:37,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:01:37,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:01:37,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:01:37,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:01:37,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:01:37,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 768 [2023-08-29 03:01:37,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 251 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 0 states have call successors, (0), 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-29 03:01:37,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:01:37,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 768 [2023-08-29 03:01:37,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand