./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c --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/weaver/chl-simpl-str-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b48bde914fb7ebeda4cbd6fd329f7fd1281e3c3e233b6f5149c7b66a2f709ab --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:28:37,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 03:28:37,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 03:28:37,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 03:28:37,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 03:28:37,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 03:28:37,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 03:28:37,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 03:28:37,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 03:28:37,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 03:28:37,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 03:28:37,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 03:28:37,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 03:28:37,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 03:28:37,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 03:28:37,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 03:28:37,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 03:28:37,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 03:28:37,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 03:28:37,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 03:28:37,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 03:28:37,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 03:28:37,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 03:28:37,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 03:28:37,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 03:28:37,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 03:28:37,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 03:28:37,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 03:28:37,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 03:28:37,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 03:28:37,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 03:28:37,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 03:28:37,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 03:28:37,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 03:28:37,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 03:28:37,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 03:28:37,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 03:28:37,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 03:28:37,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 03:28:37,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 03:28:37,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 03:28:37,172 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:28:37,193 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 03:28:37,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 03:28:37,194 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 03:28:37,195 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 03:28:37,195 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 03:28:37,195 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 03:28:37,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 03:28:37,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 03:28:37,196 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 03:28:37,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 03:28:37,197 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 03:28:37,197 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 03:28:37,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 03:28:37,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 03:28:37,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 03:28:37,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 03:28:37,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 03:28:37,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 03:28:37,198 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 03:28:37,199 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 03:28:37,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 03:28:37,199 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 03:28:37,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 03:28:37,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 03:28:37,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 03:28:37,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 03:28:37,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 03:28:37,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 03:28:37,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 03:28:37,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 03:28:37,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 03:28:37,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 03:28:37,201 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 03:28:37,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 03:28:37,201 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 03:28:37,202 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 03:28:37,202 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 03:28:37,202 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 -> 0b48bde914fb7ebeda4cbd6fd329f7fd1281e3c3e233b6f5149c7b66a2f709ab 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:28:37,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 03:28:37,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 03:28:37,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 03:28:37,520 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 03:28:37,532 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 03:28:37,534 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2023-08-29 03:28:38,491 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 03:28:38,657 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 03:28:38,658 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2023-08-29 03:28:38,662 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c445feff2/b8f731b616a64350816048aab1d700a5/FLAGa1f8952b2 [2023-08-29 03:28:38,673 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c445feff2/b8f731b616a64350816048aab1d700a5 [2023-08-29 03:28:38,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 03:28:38,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 03:28:38,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 03:28:38,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 03:28:38,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 03:28:38,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 03:28:38" (1/1) ... [2023-08-29 03:28:38,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41bffba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:28:38, skipping insertion in model container [2023-08-29 03:28:38,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 03:28:38" (1/1) ... [2023-08-29 03:28:38,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 03:28:38,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 03:28:38,834 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2514,2527] [2023-08-29 03:28:38,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 03:28:38,851 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 03:28:38,885 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2514,2527] [2023-08-29 03:28:38,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 03:28:38,896 INFO L208 MainTranslator]: Completed translation [2023-08-29 03:28:38,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:28:38 WrapperNode [2023-08-29 03:28:38,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 03:28:38,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 03:28:38,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 03:28:38,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 03:28:38,902 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:28:38" (1/1) ... [2023-08-29 03:28:38,920 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:28:38" (1/1) ... [2023-08-29 03:28:38,953 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 264 [2023-08-29 03:28:38,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 03:28:38,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 03:28:38,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 03:28:38,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 03:28:38,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:28:38" (1/1) ... [2023-08-29 03:28:38,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:28:38" (1/1) ... [2023-08-29 03:28:38,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:28:38" (1/1) ... [2023-08-29 03:28:38,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:28:38" (1/1) ... [2023-08-29 03:28:38,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:28:38" (1/1) ... [2023-08-29 03:28:38,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:28:38" (1/1) ... [2023-08-29 03:28:38,998 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:28:38" (1/1) ... [2023-08-29 03:28:39,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:28:38" (1/1) ... [2023-08-29 03:28:39,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 03:28:39,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 03:28:39,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 03:28:39,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 03:28:39,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:28:38" (1/1) ... [2023-08-29 03:28:39,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 03:28:39,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:28:39,046 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:28:39,052 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:28:39,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 03:28:39,074 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-29 03:28:39,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-29 03:28:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-29 03:28:39,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-29 03:28:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-29 03:28:39,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-29 03:28:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 03:28:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 03:28:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 03:28:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 03:28:39,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 03:28:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 03:28:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 03:28:39,077 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:28:39,200 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 03:28:39,201 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 03:28:39,552 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 03:28:39,560 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 03:28:39,560 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 03:28:39,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:28:39 BoogieIcfgContainer [2023-08-29 03:28:39,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 03:28:39,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 03:28:39,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 03:28:39,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 03:28:39,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 03:28:38" (1/3) ... [2023-08-29 03:28:39,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151785c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 03:28:39, skipping insertion in model container [2023-08-29 03:28:39,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:28:38" (2/3) ... [2023-08-29 03:28:39,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151785c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 03:28:39, skipping insertion in model container [2023-08-29 03:28:39,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:28:39" (3/3) ... [2023-08-29 03:28:39,568 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2023-08-29 03:28:39,574 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 03:28:39,580 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 03:28:39,581 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-08-29 03:28:39,581 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 03:28:39,711 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-29 03:28:39,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 320 transitions, 664 flow [2023-08-29 03:28:39,909 INFO L130 PetriNetUnfolder]: 15/317 cut-off events. [2023-08-29 03:28:39,909 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 03:28:39,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 317 events. 15/317 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 725 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. [2023-08-29 03:28:39,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 320 transitions, 664 flow [2023-08-29 03:28:39,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 293 places, 296 transitions, 610 flow [2023-08-29 03:28:39,932 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:28:39,938 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 293 places, 296 transitions, 610 flow [2023-08-29 03:28:39,941 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 293 places, 296 transitions, 610 flow [2023-08-29 03:28:39,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 293 places, 296 transitions, 610 flow [2023-08-29 03:28:39,985 INFO L130 PetriNetUnfolder]: 13/296 cut-off events. [2023-08-29 03:28:39,985 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 03:28:39,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 296 events. 13/296 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 712 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. [2023-08-29 03:28:39,997 INFO L119 LiptonReduction]: Number of co-enabled transitions 25272 [2023-08-29 03:28:45,800 INFO L134 LiptonReduction]: Checked pairs total: 78513 [2023-08-29 03:28:45,800 INFO L136 LiptonReduction]: Total number of compositions: 292 [2023-08-29 03:28:45,810 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 03:28:45,814 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;@5f2326d2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:28:45,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-08-29 03:28:45,815 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 03:28:45,815 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:28:45,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:28:45,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 03:28:45,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-29 03:28:45,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:28:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1182, now seen corresponding path program 1 times [2023-08-29 03:28:45,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:28:45,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050414918] [2023-08-29 03:28:45,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:28:45,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:28:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:28:45,884 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:28:45,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:28:45,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050414918] [2023-08-29 03:28:45,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050414918] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:28:45,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:28:45,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 03:28:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219537562] [2023-08-29 03:28:45,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:28:45,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 03:28:45,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:28:45,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 03:28:45,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 03:28:45,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 612 [2023-08-29 03:28:45,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 82 transitions, 182 flow. Second operand has 2 states, 2 states have (on average 306.5) internal successors, (613), 2 states have internal predecessors, (613), 0 states have call successors, (0), 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:28:45,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:28:45,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 612 [2023-08-29 03:28:45,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:28:46,305 INFO L130 PetriNetUnfolder]: 1661/2691 cut-off events. [2023-08-29 03:28:46,305 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2023-08-29 03:28:46,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5088 conditions, 2691 events. 1661/2691 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 16522 event pairs, 1125 based on Foata normal form. 78/2065 useless extension candidates. Maximal degree in co-relation 4500. Up to 2264 conditions per place. [2023-08-29 03:28:46,319 INFO L137 encePairwiseOnDemand]: 597/612 looper letters, 32 selfloop transitions, 0 changer transitions 1/67 dead transitions. [2023-08-29 03:28:46,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 218 flow [2023-08-29 03:28:46,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 03:28:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 03:28:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 660 transitions. [2023-08-29 03:28:46,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5392156862745098 [2023-08-29 03:28:46,330 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 660 transitions. [2023-08-29 03:28:46,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 660 transitions. [2023-08-29 03:28:46,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:28:46,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 660 transitions. [2023-08-29 03:28:46,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 330.0) internal successors, (660), 2 states have internal predecessors, (660), 0 states have call successors, (0), 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:28:46,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 612.0) internal successors, (1836), 3 states have internal predecessors, (1836), 0 states have call successors, (0), 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:28:46,340 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 612.0) internal successors, (1836), 3 states have internal predecessors, (1836), 0 states have call successors, (0), 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:28:46,341 INFO L175 Difference]: Start difference. First operand has 84 places, 82 transitions, 182 flow. Second operand 2 states and 660 transitions. [2023-08-29 03:28:46,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 218 flow [2023-08-29 03:28:46,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 67 transitions, 206 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-29 03:28:46,348 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 137 flow [2023-08-29 03:28:46,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=612, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=137, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2023-08-29 03:28:46,351 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -18 predicate places. [2023-08-29 03:28:46,351 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 137 flow [2023-08-29 03:28:46,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 306.5) internal successors, (613), 2 states have internal predecessors, (613), 0 states have call successors, (0), 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:28:46,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:28:46,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 03:28:46,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 03:28:46,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-29 03:28:46,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:28:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash 36333754, now seen corresponding path program 1 times [2023-08-29 03:28:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:28:46,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654947750] [2023-08-29 03:28:46,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:28:46,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:28:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:28:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:28:46,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:28:46,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654947750] [2023-08-29 03:28:46,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654947750] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:28:46,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:28:46,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:28:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130077575] [2023-08-29 03:28:46,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:28:46,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:28:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:28:46,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:28:46,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:28:46,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 612 [2023-08-29 03:28:46,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 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:28:46,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:28:46,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 612 [2023-08-29 03:28:46,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:28:46,730 INFO L130 PetriNetUnfolder]: 2421/4360 cut-off events. [2023-08-29 03:28:46,730 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-29 03:28:46,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7724 conditions, 4360 events. 2421/4360 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 30698 event pairs, 1191 based on Foata normal form. 0/3504 useless extension candidates. Maximal degree in co-relation 7721. Up to 3254 conditions per place. [2023-08-29 03:28:46,748 INFO L137 encePairwiseOnDemand]: 608/612 looper letters, 47 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-08-29 03:28:46,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 261 flow [2023-08-29 03:28:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:28:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:28:46,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 948 transitions. [2023-08-29 03:28:46,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163398692810458 [2023-08-29 03:28:46,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 948 transitions. [2023-08-29 03:28:46,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 948 transitions. [2023-08-29 03:28:46,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:28:46,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 948 transitions. [2023-08-29 03:28:46,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 0 states have call successors, (0), 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:28:46,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:46,757 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:46,757 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 137 flow. Second operand 3 states and 948 transitions. [2023-08-29 03:28:46,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 261 flow [2023-08-29 03:28:46,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 78 transitions, 261 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:28:46,759 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 147 flow [2023-08-29 03:28:46,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=612, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2023-08-29 03:28:46,760 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -18 predicate places. [2023-08-29 03:28:46,760 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 147 flow [2023-08-29 03:28:46,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 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:28:46,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:28:46,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 03:28:46,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 03:28:46,761 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-29 03:28:46,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:28:46,762 INFO L85 PathProgramCache]: Analyzing trace with hash 568831130, now seen corresponding path program 1 times [2023-08-29 03:28:46,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:28:46,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476848006] [2023-08-29 03:28:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:28:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:28:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:28:46,798 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:28:46,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:28:46,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476848006] [2023-08-29 03:28:46,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476848006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:28:46,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:28:46,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:28:46,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071022996] [2023-08-29 03:28:46,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:28:46,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:28:46,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:28:46,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:28:46,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:28:46,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 612 [2023-08-29 03:28:46,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 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:28:46,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:28:46,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 612 [2023-08-29 03:28:46,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:28:47,071 INFO L130 PetriNetUnfolder]: 2061/3606 cut-off events. [2023-08-29 03:28:47,071 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 03:28:47,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6492 conditions, 3606 events. 2061/3606 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 24495 event pairs, 420 based on Foata normal form. 0/2844 useless extension candidates. Maximal degree in co-relation 6488. Up to 2782 conditions per place. [2023-08-29 03:28:47,092 INFO L137 encePairwiseOnDemand]: 606/612 looper letters, 45 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-08-29 03:28:47,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 269 flow [2023-08-29 03:28:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:28:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:28:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 939 transitions. [2023-08-29 03:28:47,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.511437908496732 [2023-08-29 03:28:47,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 939 transitions. [2023-08-29 03:28:47,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 939 transitions. [2023-08-29 03:28:47,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:28:47,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 939 transitions. [2023-08-29 03:28:47,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 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:28:47,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:47,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:47,100 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 147 flow. Second operand 3 states and 939 transitions. [2023-08-29 03:28:47,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 269 flow [2023-08-29 03:28:47,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 78 transitions, 269 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:28:47,102 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 162 flow [2023-08-29 03:28:47,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=612, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2023-08-29 03:28:47,102 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -18 predicate places. [2023-08-29 03:28:47,103 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 162 flow [2023-08-29 03:28:47,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 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:28:47,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:28:47,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:28:47,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 03:28:47,104 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-29 03:28:47,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:28:47,104 INFO L85 PathProgramCache]: Analyzing trace with hash 88095111, now seen corresponding path program 1 times [2023-08-29 03:28:47,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:28:47,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077975698] [2023-08-29 03:28:47,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:28:47,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:28:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:28:47,137 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:28:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:28:47,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077975698] [2023-08-29 03:28:47,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077975698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:28:47,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:28:47,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:28:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745854084] [2023-08-29 03:28:47,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:28:47,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:28:47,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:28:47,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:28:47,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:28:47,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 612 [2023-08-29 03:28:47,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 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:28:47,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:28:47,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 612 [2023-08-29 03:28:47,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:28:47,346 INFO L130 PetriNetUnfolder]: 1944/3180 cut-off events. [2023-08-29 03:28:47,346 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-08-29 03:28:47,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6183 conditions, 3180 events. 1944/3180 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 20151 event pairs, 1107 based on Foata normal form. 0/2344 useless extension candidates. Maximal degree in co-relation 6178. Up to 2127 conditions per place. [2023-08-29 03:28:47,392 INFO L137 encePairwiseOnDemand]: 607/612 looper letters, 49 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2023-08-29 03:28:47,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 306 flow [2023-08-29 03:28:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:28:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:28:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2023-08-29 03:28:47,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-08-29 03:28:47,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 952 transitions. [2023-08-29 03:28:47,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 952 transitions. [2023-08-29 03:28:47,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:28:47,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 952 transitions. [2023-08-29 03:28:47,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 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:28:47,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:47,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:47,401 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 162 flow. Second operand 3 states and 952 transitions. [2023-08-29 03:28:47,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 306 flow [2023-08-29 03:28:47,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 306 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:28:47,402 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 168 flow [2023-08-29 03:28:47,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=612, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2023-08-29 03:28:47,403 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -17 predicate places. [2023-08-29 03:28:47,403 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 168 flow [2023-08-29 03:28:47,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 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:28:47,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:28:47,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:28:47,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 03:28:47,404 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-29 03:28:47,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:28:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1186015643, now seen corresponding path program 1 times [2023-08-29 03:28:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:28:47,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455540443] [2023-08-29 03:28:47,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:28:47,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:28:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:28:47,430 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:28:47,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:28:47,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455540443] [2023-08-29 03:28:47,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455540443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:28:47,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:28:47,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:28:47,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110377309] [2023-08-29 03:28:47,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:28:47,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:28:47,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:28:47,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:28:47,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:28:47,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 612 [2023-08-29 03:28:47,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 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:28:47,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:28:47,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 612 [2023-08-29 03:28:47,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:28:47,789 INFO L130 PetriNetUnfolder]: 3547/6121 cut-off events. [2023-08-29 03:28:47,789 INFO L131 PetriNetUnfolder]: For 957/957 co-relation queries the response was YES. [2023-08-29 03:28:47,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12270 conditions, 6121 events. 3547/6121 cut-off events. For 957/957 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 42866 event pairs, 662 based on Foata normal form. 0/4966 useless extension candidates. Maximal degree in co-relation 12264. Up to 4286 conditions per place. [2023-08-29 03:28:47,813 INFO L137 encePairwiseOnDemand]: 604/612 looper letters, 57 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2023-08-29 03:28:47,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 346 flow [2023-08-29 03:28:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:28:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:28:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 940 transitions. [2023-08-29 03:28:47,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119825708061002 [2023-08-29 03:28:47,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 940 transitions. [2023-08-29 03:28:47,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 940 transitions. [2023-08-29 03:28:47,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:28:47,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 940 transitions. [2023-08-29 03:28:47,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 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:28:47,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:47,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:47,821 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 168 flow. Second operand 3 states and 940 transitions. [2023-08-29 03:28:47,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 346 flow [2023-08-29 03:28:47,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 03:28:47,827 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 180 flow [2023-08-29 03:28:47,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=612, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2023-08-29 03:28:47,827 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -20 predicate places. [2023-08-29 03:28:47,828 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 180 flow [2023-08-29 03:28:47,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 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:28:47,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:28:47,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:28:47,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 03:28:47,829 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-29 03:28:47,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:28:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1564086585, now seen corresponding path program 1 times [2023-08-29 03:28:47,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:28:47,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594103425] [2023-08-29 03:28:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:28:47,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:28:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:28:47,850 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:28:47,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:28:47,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594103425] [2023-08-29 03:28:47,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594103425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:28:47,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:28:47,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:28:47,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232537769] [2023-08-29 03:28:47,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:28:47,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:28:47,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:28:47,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:28:47,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:28:47,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 612 [2023-08-29 03:28:47,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 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:28:47,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:28:47,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 612 [2023-08-29 03:28:47,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:28:48,313 INFO L130 PetriNetUnfolder]: 4544/7172 cut-off events. [2023-08-29 03:28:48,314 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2023-08-29 03:28:48,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14280 conditions, 7172 events. 4544/7172 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 47068 event pairs, 1455 based on Foata normal form. 0/5926 useless extension candidates. Maximal degree in co-relation 14274. Up to 3720 conditions per place. [2023-08-29 03:28:48,359 INFO L137 encePairwiseOnDemand]: 608/612 looper letters, 68 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2023-08-29 03:28:48,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 394 flow [2023-08-29 03:28:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:28:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:28:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 965 transitions. [2023-08-29 03:28:48,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525599128540305 [2023-08-29 03:28:48,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 965 transitions. [2023-08-29 03:28:48,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 965 transitions. [2023-08-29 03:28:48,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:28:48,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 965 transitions. [2023-08-29 03:28:48,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.6666666666667) internal successors, (965), 3 states have internal predecessors, (965), 0 states have call successors, (0), 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:28:48,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:48,368 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:48,369 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 180 flow. Second operand 3 states and 965 transitions. [2023-08-29 03:28:48,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 394 flow [2023-08-29 03:28:48,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 394 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:28:48,371 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 190 flow [2023-08-29 03:28:48,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=612, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2023-08-29 03:28:48,371 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -19 predicate places. [2023-08-29 03:28:48,372 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 190 flow [2023-08-29 03:28:48,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 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:28:48,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:28:48,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:28:48,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 03:28:48,373 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-29 03:28:48,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:28:48,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1888210655, now seen corresponding path program 1 times [2023-08-29 03:28:48,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:28:48,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902260352] [2023-08-29 03:28:48,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:28:48,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:28:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:28:48,399 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:28:48,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:28:48,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902260352] [2023-08-29 03:28:48,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902260352] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:28:48,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:28:48,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:28:48,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004474372] [2023-08-29 03:28:48,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:28:48,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:28:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:28:48,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:28:48,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:28:48,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 612 [2023-08-29 03:28:48,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 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:28:48,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:28:48,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 612 [2023-08-29 03:28:48,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:28:48,698 INFO L130 PetriNetUnfolder]: 3209/5037 cut-off events. [2023-08-29 03:28:48,698 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2023-08-29 03:28:48,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10320 conditions, 5037 events. 3209/5037 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 31834 event pairs, 1962 based on Foata normal form. 0/3852 useless extension candidates. Maximal degree in co-relation 10313. Up to 3622 conditions per place. [2023-08-29 03:28:48,725 INFO L137 encePairwiseOnDemand]: 607/612 looper letters, 49 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2023-08-29 03:28:48,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 338 flow [2023-08-29 03:28:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:28:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:28:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2023-08-29 03:28:48,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-08-29 03:28:48,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 952 transitions. [2023-08-29 03:28:48,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 952 transitions. [2023-08-29 03:28:48,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:28:48,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 952 transitions. [2023-08-29 03:28:48,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 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:28:48,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:48,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:48,733 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 190 flow. Second operand 3 states and 952 transitions. [2023-08-29 03:28:48,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 338 flow [2023-08-29 03:28:48,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:28:48,735 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 196 flow [2023-08-29 03:28:48,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=612, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2023-08-29 03:28:48,736 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -18 predicate places. [2023-08-29 03:28:48,736 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 196 flow [2023-08-29 03:28:48,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 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:28:48,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:28:48,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:28:48,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 03:28:48,738 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-29 03:28:48,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:28:48,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1595684877, now seen corresponding path program 1 times [2023-08-29 03:28:48,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:28:48,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185381006] [2023-08-29 03:28:48,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:28:48,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:28:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:28:48,758 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:28:48,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:28:48,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185381006] [2023-08-29 03:28:48,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185381006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:28:48,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:28:48,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:28:48,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240567079] [2023-08-29 03:28:48,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:28:48,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:28:48,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:28:48,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:28:48,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:28:48,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 612 [2023-08-29 03:28:48,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 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:28:48,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:28:48,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 612 [2023-08-29 03:28:48,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:28:49,150 INFO L130 PetriNetUnfolder]: 4589/7216 cut-off events. [2023-08-29 03:28:49,151 INFO L131 PetriNetUnfolder]: For 1014/1014 co-relation queries the response was YES. [2023-08-29 03:28:49,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15546 conditions, 7216 events. 4589/7216 cut-off events. For 1014/1014 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 47449 event pairs, 1694 based on Foata normal form. 0/5738 useless extension candidates. Maximal degree in co-relation 15538. Up to 3534 conditions per place. [2023-08-29 03:28:49,185 INFO L137 encePairwiseOnDemand]: 608/612 looper letters, 63 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-08-29 03:28:49,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 91 transitions, 394 flow [2023-08-29 03:28:49,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:28:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:28:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2023-08-29 03:28:49,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5239651416122004 [2023-08-29 03:28:49,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 962 transitions. [2023-08-29 03:28:49,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 962 transitions. [2023-08-29 03:28:49,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:28:49,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 962 transitions. [2023-08-29 03:28:49,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 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:28:49,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:49,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:49,192 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 196 flow. Second operand 3 states and 962 transitions. [2023-08-29 03:28:49,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 91 transitions, 394 flow [2023-08-29 03:28:49,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 91 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 03:28:49,211 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 198 flow [2023-08-29 03:28:49,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=612, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2023-08-29 03:28:49,212 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -19 predicate places. [2023-08-29 03:28:49,212 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 198 flow [2023-08-29 03:28:49,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 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:28:49,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:28:49,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:28:49,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 03:28:49,213 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-29 03:28:49,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:28:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash 149867889, now seen corresponding path program 1 times [2023-08-29 03:28:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:28:49,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694008785] [2023-08-29 03:28:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:28:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:28:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:28:49,233 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:28:49,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:28:49,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694008785] [2023-08-29 03:28:49,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694008785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:28:49,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:28:49,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:28:49,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834535914] [2023-08-29 03:28:49,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:28:49,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:28:49,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:28:49,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:28:49,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:28:49,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 612 [2023-08-29 03:28:49,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 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:28:49,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:28:49,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 612 [2023-08-29 03:28:49,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:28:49,681 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L43-14-->L43-24: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_#t~ret1#1_25|)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| v_~to_int_3~0_51) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| v_~to_int_1~0_47) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| |v_thread1Thread1of1ForFork1_minus_~b#1_51|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) 1 0)) (= v_~result_6~0_48 |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| |v_thread1Thread1of1ForFork1_minus_~a#1_49|) (<= |v_thread1Thread1of1ForFork1_#t~ret1#1_25| 2147483647) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_#race~result_6~0_41| |v_thread1Thread1of1ForFork1_#t~nondet4#1_35|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (= 0 |v_#race~to_int_3~0_48|)) InVars {#race~to_int_3~0=|v_#race~to_int_3~0_48|, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47} OutVars{thread1Thread1of1ForFork1_#t~nondet4#1=|v_thread1Thread1of1ForFork1_#t~nondet4#1_35|, thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_31|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_25|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_21|, #race~to_int_3~0=|v_#race~to_int_3~0_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_37|, #race~result_6~0=|v_#race~result_6~0_41|, ~result_6~0=v_~result_6~0_48, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_27|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_51|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_33|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_49|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4#1, thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, #race~result_6~0, ~result_6~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][80], [Black: 349#true, 323#(= |#race~length_0~0| 0), 172#L55-22true, Black: 321#true, Black: 326#true, 328#(= |#race~length_2~0| 0), 337#(= |#race~length_4~0| 0), Black: 335#true, 347#(= |#race~result_7~0| |thread2Thread1of1ForFork2_#t~nondet8#1|), Black: 340#true, 351#(= |#race~to_int_3~0| 0), 169#L75-6true, 318#true, 356#(= |#race~to_int_5~0| 0), 333#(= |thread1Thread1of1ForFork1_#t~nondet4#1| |#race~result_6~0|), 342#(= |#race~to_int_1~0| 0)]) [2023-08-29 03:28:49,682 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 03:28:49,682 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:28:49,682 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:28:49,682 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:28:49,685 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L43-14-->L43-24: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_#t~ret1#1_25|)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| v_~to_int_3~0_51) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| v_~to_int_1~0_47) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| |v_thread1Thread1of1ForFork1_minus_~b#1_51|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) 1 0)) (= v_~result_6~0_48 |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| |v_thread1Thread1of1ForFork1_minus_~a#1_49|) (<= |v_thread1Thread1of1ForFork1_#t~ret1#1_25| 2147483647) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_#race~result_6~0_41| |v_thread1Thread1of1ForFork1_#t~nondet4#1_35|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (= 0 |v_#race~to_int_3~0_48|)) InVars {#race~to_int_3~0=|v_#race~to_int_3~0_48|, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47} OutVars{thread1Thread1of1ForFork1_#t~nondet4#1=|v_thread1Thread1of1ForFork1_#t~nondet4#1_35|, thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_31|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_25|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_21|, #race~to_int_3~0=|v_#race~to_int_3~0_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_37|, #race~result_6~0=|v_#race~result_6~0_41|, ~result_6~0=v_~result_6~0_48, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_27|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_51|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_33|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_49|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4#1, thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, #race~result_6~0, ~result_6~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][80], [Black: 349#true, 323#(= |#race~length_0~0| 0), Black: 321#true, 79#L74-4true, Black: 326#true, 328#(= |#race~length_2~0| 0), 158#thread3EXITtrue, 337#(= |#race~length_4~0| 0), Black: 335#true, 347#(= |#race~result_7~0| |thread2Thread1of1ForFork2_#t~nondet8#1|), Black: 340#true, 351#(= |#race~to_int_3~0| 0), 318#true, 356#(= |#race~to_int_5~0| 0), 333#(= |thread1Thread1of1ForFork1_#t~nondet4#1| |#race~result_6~0|), 342#(= |#race~to_int_1~0| 0)]) [2023-08-29 03:28:49,685 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 03:28:49,685 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:28:49,685 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:28:49,685 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:28:49,691 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L43-14-->L43-24: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_#t~ret1#1_25|)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| v_~to_int_3~0_51) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| v_~to_int_1~0_47) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| |v_thread1Thread1of1ForFork1_minus_~b#1_51|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) 1 0)) (= v_~result_6~0_48 |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| |v_thread1Thread1of1ForFork1_minus_~a#1_49|) (<= |v_thread1Thread1of1ForFork1_#t~ret1#1_25| 2147483647) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_#race~result_6~0_41| |v_thread1Thread1of1ForFork1_#t~nondet4#1_35|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (= 0 |v_#race~to_int_3~0_48|)) InVars {#race~to_int_3~0=|v_#race~to_int_3~0_48|, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47} OutVars{thread1Thread1of1ForFork1_#t~nondet4#1=|v_thread1Thread1of1ForFork1_#t~nondet4#1_35|, thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_31|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_25|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_21|, #race~to_int_3~0=|v_#race~to_int_3~0_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_37|, #race~result_6~0=|v_#race~result_6~0_41|, ~result_6~0=v_~result_6~0_48, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_27|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_51|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_33|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_49|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4#1, thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, #race~result_6~0, ~result_6~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][80], [Black: 349#true, 323#(= |#race~length_0~0| 0), 172#L55-22true, Black: 321#true, Black: 326#true, 328#(= |#race~length_2~0| 0), 152#thread2EXITtrue, 337#(= |#race~length_4~0| 0), Black: 335#true, Black: 340#true, 351#(= |#race~to_int_3~0| 0), 169#L75-6true, 356#(= |#race~to_int_5~0| 0), 318#true, 333#(= |thread1Thread1of1ForFork1_#t~nondet4#1| |#race~result_6~0|), 342#(= |#race~to_int_1~0| 0)]) [2023-08-29 03:28:49,691 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 03:28:49,691 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:28:49,691 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:28:49,691 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:28:49,692 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L43-14-->L43-24: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_#t~ret1#1_25|)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| v_~to_int_3~0_51) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| v_~to_int_1~0_47) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| |v_thread1Thread1of1ForFork1_minus_~b#1_51|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) 1 0)) (= v_~result_6~0_48 |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| |v_thread1Thread1of1ForFork1_minus_~a#1_49|) (<= |v_thread1Thread1of1ForFork1_#t~ret1#1_25| 2147483647) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_#race~result_6~0_41| |v_thread1Thread1of1ForFork1_#t~nondet4#1_35|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (= 0 |v_#race~to_int_3~0_48|)) InVars {#race~to_int_3~0=|v_#race~to_int_3~0_48|, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47} OutVars{thread1Thread1of1ForFork1_#t~nondet4#1=|v_thread1Thread1of1ForFork1_#t~nondet4#1_35|, thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_31|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_25|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_21|, #race~to_int_3~0=|v_#race~to_int_3~0_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_37|, #race~result_6~0=|v_#race~result_6~0_41|, ~result_6~0=v_~result_6~0_48, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_27|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_51|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_33|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_49|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4#1, thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, #race~result_6~0, ~result_6~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][80], [Black: 349#true, 323#(= |#race~length_0~0| 0), Black: 321#true, Black: 326#true, 328#(= |#race~length_2~0| 0), 158#thread3EXITtrue, 337#(= |#race~length_4~0| 0), Black: 335#true, 347#(= |#race~result_7~0| |thread2Thread1of1ForFork2_#t~nondet8#1|), Black: 340#true, 351#(= |#race~to_int_3~0| 0), 169#L75-6true, 318#true, 356#(= |#race~to_int_5~0| 0), 333#(= |thread1Thread1of1ForFork1_#t~nondet4#1| |#race~result_6~0|), 342#(= |#race~to_int_1~0| 0)]) [2023-08-29 03:28:49,692 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 03:28:49,692 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:28:49,692 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:28:49,693 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:28:49,694 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L43-14-->L43-24: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_#t~ret1#1_25|)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| v_~to_int_3~0_51) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| v_~to_int_1~0_47) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| |v_thread1Thread1of1ForFork1_minus_~b#1_51|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) 1 0)) (= v_~result_6~0_48 |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| |v_thread1Thread1of1ForFork1_minus_~a#1_49|) (<= |v_thread1Thread1of1ForFork1_#t~ret1#1_25| 2147483647) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_#race~result_6~0_41| |v_thread1Thread1of1ForFork1_#t~nondet4#1_35|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (= 0 |v_#race~to_int_3~0_48|)) InVars {#race~to_int_3~0=|v_#race~to_int_3~0_48|, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47} OutVars{thread1Thread1of1ForFork1_#t~nondet4#1=|v_thread1Thread1of1ForFork1_#t~nondet4#1_35|, thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_31|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_25|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_21|, #race~to_int_3~0=|v_#race~to_int_3~0_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_37|, #race~result_6~0=|v_#race~result_6~0_41|, ~result_6~0=v_~result_6~0_48, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_27|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_51|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_33|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_49|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4#1, thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, #race~result_6~0, ~result_6~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][80], [Black: 349#true, 323#(= |#race~length_0~0| 0), 172#L55-22true, Black: 321#true, 79#L74-4true, Black: 326#true, 328#(= |#race~length_2~0| 0), 337#(= |#race~length_4~0| 0), Black: 335#true, 347#(= |#race~result_7~0| |thread2Thread1of1ForFork2_#t~nondet8#1|), Black: 340#true, 351#(= |#race~to_int_3~0| 0), 318#true, 356#(= |#race~to_int_5~0| 0), 333#(= |thread1Thread1of1ForFork1_#t~nondet4#1| |#race~result_6~0|), 342#(= |#race~to_int_1~0| 0)]) [2023-08-29 03:28:49,694 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 03:28:49,694 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:28:49,694 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 03:28:49,694 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:28:49,695 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L43-14-->L43-24: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_#t~ret1#1_25|)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| v_~to_int_3~0_51) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| v_~to_int_1~0_47) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| |v_thread1Thread1of1ForFork1_minus_~b#1_51|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) 1 0)) (= v_~result_6~0_48 |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| |v_thread1Thread1of1ForFork1_minus_~a#1_49|) (<= |v_thread1Thread1of1ForFork1_#t~ret1#1_25| 2147483647) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_#race~result_6~0_41| |v_thread1Thread1of1ForFork1_#t~nondet4#1_35|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (= 0 |v_#race~to_int_3~0_48|)) InVars {#race~to_int_3~0=|v_#race~to_int_3~0_48|, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47} OutVars{thread1Thread1of1ForFork1_#t~nondet4#1=|v_thread1Thread1of1ForFork1_#t~nondet4#1_35|, thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_31|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_25|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_21|, #race~to_int_3~0=|v_#race~to_int_3~0_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_37|, #race~result_6~0=|v_#race~result_6~0_41|, ~result_6~0=v_~result_6~0_48, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_27|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_51|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_33|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_49|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4#1, thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, #race~result_6~0, ~result_6~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][80], [Black: 349#true, 323#(= |#race~length_0~0| 0), Black: 321#true, 79#L74-4true, Black: 326#true, 328#(= |#race~length_2~0| 0), 152#thread2EXITtrue, 158#thread3EXITtrue, 337#(= |#race~length_4~0| 0), Black: 335#true, Black: 340#true, 351#(= |#race~to_int_3~0| 0), 318#true, 356#(= |#race~to_int_5~0| 0), 333#(= |thread1Thread1of1ForFork1_#t~nondet4#1| |#race~result_6~0|), 342#(= |#race~to_int_1~0| 0)]) [2023-08-29 03:28:49,695 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 03:28:49,695 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:28:49,695 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:28:49,695 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:28:49,698 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L43-14-->L43-24: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_#t~ret1#1_25|)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| v_~to_int_3~0_51) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| v_~to_int_1~0_47) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| |v_thread1Thread1of1ForFork1_minus_~b#1_51|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) 1 0)) (= v_~result_6~0_48 |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| |v_thread1Thread1of1ForFork1_minus_~a#1_49|) (<= |v_thread1Thread1of1ForFork1_#t~ret1#1_25| 2147483647) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_#race~result_6~0_41| |v_thread1Thread1of1ForFork1_#t~nondet4#1_35|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (= 0 |v_#race~to_int_3~0_48|)) InVars {#race~to_int_3~0=|v_#race~to_int_3~0_48|, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47} OutVars{thread1Thread1of1ForFork1_#t~nondet4#1=|v_thread1Thread1of1ForFork1_#t~nondet4#1_35|, thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_31|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_25|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_21|, #race~to_int_3~0=|v_#race~to_int_3~0_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_37|, #race~result_6~0=|v_#race~result_6~0_41|, ~result_6~0=v_~result_6~0_48, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_27|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_51|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_33|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_49|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4#1, thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, #race~result_6~0, ~result_6~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][80], [Black: 349#true, 323#(= |#race~length_0~0| 0), Black: 321#true, Black: 326#true, 328#(= |#race~length_2~0| 0), 152#thread2EXITtrue, 158#thread3EXITtrue, 337#(= |#race~length_4~0| 0), Black: 335#true, Black: 340#true, 351#(= |#race~to_int_3~0| 0), 169#L75-6true, 318#true, 356#(= |#race~to_int_5~0| 0), 333#(= |thread1Thread1of1ForFork1_#t~nondet4#1| |#race~result_6~0|), 342#(= |#race~to_int_1~0| 0)]) [2023-08-29 03:28:49,698 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 03:28:49,699 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 03:28:49,699 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 03:28:49,699 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 03:28:49,699 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L43-14-->L43-24: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_#t~ret1#1_25|)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| v_~to_int_3~0_51) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| v_~to_int_1~0_47) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_27| |v_thread1Thread1of1ForFork1_minus_~b#1_51|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) 1 0)) (= v_~result_6~0_48 |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_21| |v_thread1Thread1of1ForFork1_minus_~a#1_49|) (<= |v_thread1Thread1of1ForFork1_#t~ret1#1_25| 2147483647) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ret1#1_25|) (= |v_thread1Thread1of1ForFork1_#t~ite2#1_31| |v_thread1Thread1of1ForFork1_#t~ite3#1_33|) (= |v_#race~result_6~0_41| |v_thread1Thread1of1ForFork1_#t~nondet4#1_35|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread1Thread1of1ForFork1_minus_#res#1_37| |v_thread1Thread1of1ForFork1_minus_~b#1_51|)) (= 0 |v_#race~to_int_3~0_48|)) InVars {#race~to_int_3~0=|v_#race~to_int_3~0_48|, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47} OutVars{thread1Thread1of1ForFork1_#t~nondet4#1=|v_thread1Thread1of1ForFork1_#t~nondet4#1_35|, thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_31|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_25|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_21|, #race~to_int_3~0=|v_#race~to_int_3~0_48|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_37|, #race~result_6~0=|v_#race~result_6~0_41|, ~result_6~0=v_~result_6~0_48, ~to_int_3~0=v_~to_int_3~0_51, ~to_int_1~0=v_~to_int_1~0_47, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_27|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_51|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_33|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_49|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4#1, thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, #race~result_6~0, ~result_6~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][80], [Black: 349#true, 323#(= |#race~length_0~0| 0), 172#L55-22true, Black: 321#true, 79#L74-4true, Black: 326#true, 328#(= |#race~length_2~0| 0), 152#thread2EXITtrue, 337#(= |#race~length_4~0| 0), Black: 335#true, Black: 340#true, 351#(= |#race~to_int_3~0| 0), 318#true, 356#(= |#race~to_int_5~0| 0), 333#(= |thread1Thread1of1ForFork1_#t~nondet4#1| |#race~result_6~0|), 342#(= |#race~to_int_1~0| 0)]) [2023-08-29 03:28:49,700 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 03:28:49,700 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:28:49,700 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 03:28:49,700 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:28:49,702 INFO L130 PetriNetUnfolder]: 5182/7908 cut-off events. [2023-08-29 03:28:49,702 INFO L131 PetriNetUnfolder]: For 582/582 co-relation queries the response was YES. [2023-08-29 03:28:49,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16864 conditions, 7908 events. 5182/7908 cut-off events. For 582/582 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 49875 event pairs, 2090 based on Foata normal form. 0/6357 useless extension candidates. Maximal degree in co-relation 16856. Up to 3885 conditions per place. [2023-08-29 03:28:49,719 INFO L137 encePairwiseOnDemand]: 608/612 looper letters, 0 selfloop transitions, 0 changer transitions 93/93 dead transitions. [2023-08-29 03:28:49,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 410 flow [2023-08-29 03:28:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:28:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:28:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2023-08-29 03:28:49,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234204793028322 [2023-08-29 03:28:49,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 961 transitions. [2023-08-29 03:28:49,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 961 transitions. [2023-08-29 03:28:49,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:28:49,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 961 transitions. [2023-08-29 03:28:49,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 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:28:49,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:49,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 612.0) internal successors, (2448), 4 states have internal predecessors, (2448), 0 states have call successors, (0), 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:28:49,727 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 198 flow. Second operand 3 states and 961 transitions. [2023-08-29 03:28:49,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 410 flow [2023-08-29 03:28:49,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 93 transitions, 410 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:28:49,728 INFO L231 Difference]: Finished difference. Result has 65 places, 0 transitions, 0 flow [2023-08-29 03:28:49,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=612, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=65, PETRI_TRANSITIONS=0} [2023-08-29 03:28:49,729 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -19 predicate places. [2023-08-29 03:28:49,729 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 0 transitions, 0 flow [2023-08-29 03:28:49,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 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:28:49,732 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining) [2023-08-29 03:28:49,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2023-08-29 03:28:49,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2023-08-29 03:28:49,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2023-08-29 03:28:49,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2023-08-29 03:28:49,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2023-08-29 03:28:49,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2023-08-29 03:28:49,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2023-08-29 03:28:49,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2023-08-29 03:28:49,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2023-08-29 03:28:49,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2023-08-29 03:28:49,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2023-08-29 03:28:49,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2023-08-29 03:28:49,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2023-08-29 03:28:49,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2023-08-29 03:28:49,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2023-08-29 03:28:49,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2023-08-29 03:28:49,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2023-08-29 03:28:49,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2023-08-29 03:28:49,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2023-08-29 03:28:49,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2023-08-29 03:28:49,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2023-08-29 03:28:49,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2023-08-29 03:28:49,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2023-08-29 03:28:49,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2023-08-29 03:28:49,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2023-08-29 03:28:49,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2023-08-29 03:28:49,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2023-08-29 03:28:49,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2023-08-29 03:28:49,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2023-08-29 03:28:49,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 51 remaining) [2023-08-29 03:28:49,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 51 remaining) [2023-08-29 03:28:49,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining) [2023-08-29 03:28:49,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2023-08-29 03:28:49,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2023-08-29 03:28:49,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2023-08-29 03:28:49,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2023-08-29 03:28:49,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2023-08-29 03:28:49,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2023-08-29 03:28:49,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2023-08-29 03:28:49,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2023-08-29 03:28:49,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2023-08-29 03:28:49,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2023-08-29 03:28:49,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2023-08-29 03:28:49,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2023-08-29 03:28:49,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2023-08-29 03:28:49,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2023-08-29 03:28:49,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2023-08-29 03:28:49,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2023-08-29 03:28:49,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2023-08-29 03:28:49,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2023-08-29 03:28:49,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 03:28:49,742 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:28:49,746 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 03:28:49,746 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 03:28:49,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 03:28:49 BasicIcfg [2023-08-29 03:28:49,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 03:28:49,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 03:28:49,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 03:28:49,749 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 03:28:49,750 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:28:39" (3/4) ... [2023-08-29 03:28:49,751 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-08-29 03:28:49,755 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-08-29 03:28:49,755 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-08-29 03:28:49,755 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-08-29 03:28:49,759 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-08-29 03:28:49,759 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-08-29 03:28:49,759 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-08-29 03:28:49,760 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-08-29 03:28:49,796 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-29 03:28:49,796 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 03:28:49,797 INFO L158 Benchmark]: Toolchain (without parser) took 11121.10ms. Allocated memory was 90.2MB in the beginning and 1.0GB in the end (delta: 910.2MB). Free memory was 65.6MB in the beginning and 812.1MB in the end (delta: -746.5MB). Peak memory consumption was 163.5MB. Max. memory is 16.1GB. [2023-08-29 03:28:49,797 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 65.0MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 03:28:49,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.46ms. Allocated memory is still 90.2MB. Free memory was 65.4MB in the beginning and 53.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-08-29 03:28:49,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.47ms. Allocated memory is still 90.2MB. Free memory was 53.7MB in the beginning and 51.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 03:28:49,798 INFO L158 Benchmark]: Boogie Preprocessor took 48.10ms. Allocated memory is still 90.2MB. Free memory was 51.2MB in the beginning and 49.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 03:28:49,798 INFO L158 Benchmark]: RCFGBuilder took 557.13ms. Allocated memory is still 90.2MB. Free memory was 49.1MB in the beginning and 47.0MB in the end (delta: 2.2MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2023-08-29 03:28:49,798 INFO L158 Benchmark]: TraceAbstraction took 10184.97ms. Allocated memory was 90.2MB in the beginning and 1.0GB in the end (delta: 910.2MB). Free memory was 46.1MB in the beginning and 815.2MB in the end (delta: -769.0MB). Peak memory consumption was 374.1MB. Max. memory is 16.1GB. [2023-08-29 03:28:49,799 INFO L158 Benchmark]: Witness Printer took 47.30ms. Allocated memory is still 1.0GB. Free memory was 815.2MB in the beginning and 812.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 03:28:49,800 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 65.0MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.46ms. Allocated memory is still 90.2MB. Free memory was 65.4MB in the beginning and 53.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.47ms. Allocated memory is still 90.2MB. Free memory was 53.7MB in the beginning and 51.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.10ms. Allocated memory is still 90.2MB. Free memory was 51.2MB in the beginning and 49.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 557.13ms. Allocated memory is still 90.2MB. Free memory was 49.1MB in the beginning and 47.0MB in the end (delta: 2.2MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10184.97ms. Allocated memory was 90.2MB in the beginning and 1.0GB in the end (delta: 910.2MB). Free memory was 46.1MB in the beginning and 815.2MB in the end (delta: -769.0MB). Peak memory consumption was 374.1MB. Max. memory is 16.1GB. * Witness Printer took 47.30ms. Allocated memory is still 1.0GB. Free memory was 815.2MB in the beginning and 812.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 293 PlacesBefore, 84 PlacesAfterwards, 296 TransitionsBefore, 82 TransitionsAfterwards, 25272 CoEnabledTransitionPairs, 9 FixpointIterations, 110 TrivialSequentialCompositions, 140 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 34 ConcurrentYvCompositions, 5 ChoiceCompositions, 292 TotalNumberOfCompositions, 78513 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45228, independent: 44289, independent conditional: 0, independent unconditional: 44289, dependent: 939, dependent conditional: 0, dependent unconditional: 939, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 14935, independent: 14850, independent conditional: 0, independent unconditional: 14850, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 45228, independent: 29439, independent conditional: 0, independent unconditional: 29439, dependent: 854, dependent conditional: 0, dependent unconditional: 854, unknown: 14935, unknown conditional: 0, unknown unconditional: 14935] , Statistics on independence cache: Total cache size (in pairs): 1135, Positive cache size: 1087, Positive conditional cache size: 0, Positive unconditional cache size: 1087, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 462 locations, 51 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 353 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 716 IncrementalHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 41 mSDtfsCounter, 716 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=8, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 72 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-08-29 03:28:49,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE