/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 12:51:28,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 12:51:28,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 12:51:29,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 12:51:29,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 12:51:29,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 12:51:29,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 12:51:29,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 12:51:29,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 12:51:29,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 12:51:29,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 12:51:29,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 12:51:29,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 12:51:29,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 12:51:29,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 12:51:29,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 12:51:29,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 12:51:29,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 12:51:29,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 12:51:29,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 12:51:29,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 12:51:29,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 12:51:29,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 12:51:29,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 12:51:29,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 12:51:29,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 12:51:29,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 12:51:29,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 12:51:29,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 12:51:29,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 12:51:29,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 12:51:29,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 12:51:29,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 12:51:29,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 12:51:29,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 12:51:29,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 12:51:29,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 12:51:29,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 12:51:29,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 12:51:29,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 12:51:29,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 12:51:29,063 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-12 12:51:29,086 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 12:51:29,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 12:51:29,087 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 12:51:29,088 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 12:51:29,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 12:51:29,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 12:51:29,089 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 12:51:29,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 12:51:29,089 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 12:51:29,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 12:51:29,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 12:51:29,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 12:51:29,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 12:51:29,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 12:51:29,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 12:51:29,090 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 12:51:29,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 12:51:29,090 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 12:51:29,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 12:51:29,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 12:51:29,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 12:51:29,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 12:51:29,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 12:51:29,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:51:29,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 12:51:29,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 12:51:29,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 12:51:29,091 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 12:51:29,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 12:51:29,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 12:51:29,092 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 12:51:29,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 12:51:29,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 12:51:29,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 12:51:29,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 12:51:29,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 12:51:29,348 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 12:51:29,349 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c [2022-12-12 12:51:30,220 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 12:51:30,396 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 12:51:30,396 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c [2022-12-12 12:51:30,401 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f387ba23/59ff5b5b3480472fadf586957a67e6f3/FLAGe245203f3 [2022-12-12 12:51:30,410 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f387ba23/59ff5b5b3480472fadf586957a67e6f3 [2022-12-12 12:51:30,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 12:51:30,412 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 12:51:30,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 12:51:30,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 12:51:30,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 12:51:30,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:51:30" (1/1) ... [2022-12-12 12:51:30,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ec6a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30, skipping insertion in model container [2022-12-12 12:51:30,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:51:30" (1/1) ... [2022-12-12 12:51:30,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 12:51:30,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 12:51:30,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,640 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c[5938,5951] [2022-12-12 12:51:30,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:51:30,652 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 12:51:30,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:51:30,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:51:30,710 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c[5938,5951] [2022-12-12 12:51:30,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:51:30,720 INFO L208 MainTranslator]: Completed translation [2022-12-12 12:51:30,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30 WrapperNode [2022-12-12 12:51:30,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 12:51:30,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 12:51:30,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 12:51:30,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 12:51:30,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30" (1/1) ... [2022-12-12 12:51:30,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30" (1/1) ... [2022-12-12 12:51:30,768 INFO L138 Inliner]: procedures = 25, calls = 120, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 248 [2022-12-12 12:51:30,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 12:51:30,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 12:51:30,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 12:51:30,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 12:51:30,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30" (1/1) ... [2022-12-12 12:51:30,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30" (1/1) ... [2022-12-12 12:51:30,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30" (1/1) ... [2022-12-12 12:51:30,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30" (1/1) ... [2022-12-12 12:51:30,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30" (1/1) ... [2022-12-12 12:51:30,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30" (1/1) ... [2022-12-12 12:51:30,802 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30" (1/1) ... [2022-12-12 12:51:30,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30" (1/1) ... [2022-12-12 12:51:30,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 12:51:30,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 12:51:30,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 12:51:30,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 12:51:30,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30" (1/1) ... [2022-12-12 12:51:30,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:51:30,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 12:51:30,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 12:51:30,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 12:51:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 12:51:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 12:51:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 12:51:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 12:51:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 12:51:30,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 12:51:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 12:51:30,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 12:51:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 12:51:30,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 12:51:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-12 12:51:30,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-12 12:51:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 12:51:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-12 12:51:30,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-12 12:51:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-12 12:51:30,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-12 12:51:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 12:51:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 12:51:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 12:51:30,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 12:51:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 12:51:30,872 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 12:51:30,968 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 12:51:30,969 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 12:51:31,228 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 12:51:31,317 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 12:51:31,317 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-12 12:51:31,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:51:31 BoogieIcfgContainer [2022-12-12 12:51:31,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 12:51:31,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 12:51:31,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 12:51:31,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 12:51:31,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 12:51:30" (1/3) ... [2022-12-12 12:51:31,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b67d72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:51:31, skipping insertion in model container [2022-12-12 12:51:31,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:51:30" (2/3) ... [2022-12-12 12:51:31,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b67d72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:51:31, skipping insertion in model container [2022-12-12 12:51:31,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:51:31" (3/3) ... [2022-12-12 12:51:31,330 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2022-12-12 12:51:31,343 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 12:51:31,343 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 12:51:31,343 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 12:51:31,463 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-12-12 12:51:31,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 245 transitions, 562 flow [2022-12-12 12:51:31,600 INFO L130 PetriNetUnfolder]: 14/217 cut-off events. [2022-12-12 12:51:31,601 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-12 12:51:31,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 217 events. 14/217 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 364 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 182. Up to 3 conditions per place. [2022-12-12 12:51:31,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 245 transitions, 562 flow [2022-12-12 12:51:31,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 214 places, 209 transitions, 466 flow [2022-12-12 12:51:31,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 12:51:31,631 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=false, 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;@61eb4eb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 12:51:31,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-12-12 12:51:31,673 INFO L130 PetriNetUnfolder]: 14/208 cut-off events. [2022-12-12 12:51:31,673 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-12 12:51:31,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:51:31,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:51:31,674 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-12 12:51:31,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:51:31,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1526866170, now seen corresponding path program 1 times [2022-12-12 12:51:31,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:51:31,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322802847] [2022-12-12 12:51:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:51:31,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:51:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:51:31,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:51:31,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:51:31,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322802847] [2022-12-12 12:51:31,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322802847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:51:31,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:51:31,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 12:51:31,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087535334] [2022-12-12 12:51:31,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:51:31,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-12 12:51:31,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:51:31,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-12 12:51:31,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-12 12:51:31,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 249 [2022-12-12 12:51:31,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 209 transitions, 466 flow. Second operand has 2 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:31,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:51:31,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 249 [2022-12-12 12:51:31,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:51:32,226 INFO L130 PetriNetUnfolder]: 408/1371 cut-off events. [2022-12-12 12:51:32,226 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2022-12-12 12:51:32,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 1371 events. 408/1371 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 8342 event pairs, 192 based on Foata normal form. 146/1402 useless extension candidates. Maximal degree in co-relation 2043. Up to 553 conditions per place. [2022-12-12 12:51:32,244 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 26 selfloop transitions, 0 changer transitions 2/203 dead transitions. [2022-12-12 12:51:32,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 203 transitions, 506 flow [2022-12-12 12:51:32,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-12 12:51:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-12 12:51:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 448 transitions. [2022-12-12 12:51:32,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8995983935742972 [2022-12-12 12:51:32,263 INFO L295 CegarLoopForPetriNet]: 214 programPoint places, 1 predicate places. [2022-12-12 12:51:32,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 203 transitions, 506 flow [2022-12-12 12:51:32,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 203 transitions, 472 flow, removed 1 selfloop flow, removed 12 redundant places. [2022-12-12 12:51:32,271 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 203 transitions, 472 flow [2022-12-12 12:51:32,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:32,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:51:32,272 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:51:32,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 12:51:32,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-12 12:51:32,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:51:32,274 INFO L85 PathProgramCache]: Analyzing trace with hash -357962372, now seen corresponding path program 1 times [2022-12-12 12:51:32,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:51:32,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316775186] [2022-12-12 12:51:32,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:51:32,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:51:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:51:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:51:33,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:51:33,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316775186] [2022-12-12 12:51:33,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316775186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:51:33,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:51:33,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:51:33,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484202132] [2022-12-12 12:51:33,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:51:33,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:51:33,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:51:33,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:51:33,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:51:33,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 249 [2022-12-12 12:51:33,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 203 transitions, 472 flow. Second operand has 7 states, 7 states have (on average 178.28571428571428) internal successors, (1248), 7 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:33,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:51:33,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 249 [2022-12-12 12:51:33,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:51:34,827 INFO L130 PetriNetUnfolder]: 8825/14583 cut-off events. [2022-12-12 12:51:34,827 INFO L131 PetriNetUnfolder]: For 5344/5431 co-relation queries the response was YES. [2022-12-12 12:51:34,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32685 conditions, 14583 events. 8825/14583 cut-off events. For 5344/5431 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 109568 event pairs, 4786 based on Foata normal form. 0/13485 useless extension candidates. Maximal degree in co-relation 31313. Up to 11272 conditions per place. [2022-12-12 12:51:34,931 INFO L137 encePairwiseOnDemand]: 237/249 looper letters, 75 selfloop transitions, 7 changer transitions 7/232 dead transitions. [2022-12-12 12:51:34,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 232 transitions, 757 flow [2022-12-12 12:51:34,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 12:51:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 12:51:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1656 transitions. [2022-12-12 12:51:34,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7389558232931727 [2022-12-12 12:51:34,934 INFO L295 CegarLoopForPetriNet]: 214 programPoint places, -3 predicate places. [2022-12-12 12:51:34,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 232 transitions, 757 flow [2022-12-12 12:51:34,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 232 transitions, 648 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-12-12 12:51:34,957 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 232 transitions, 648 flow [2022-12-12 12:51:34,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 178.28571428571428) internal successors, (1248), 7 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:34,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:51:34,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:51:34,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 12:51:34,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-12 12:51:34,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:51:34,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1459501100, now seen corresponding path program 1 times [2022-12-12 12:51:34,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:51:34,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952222043] [2022-12-12 12:51:34,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:51:34,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:51:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:51:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:51:35,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:51:35,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952222043] [2022-12-12 12:51:35,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952222043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:51:35,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:51:35,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 12:51:35,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806506682] [2022-12-12 12:51:35,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:51:35,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 12:51:35,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:51:35,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 12:51:35,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 12:51:35,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249 [2022-12-12 12:51:35,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 232 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:35,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:51:35,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249 [2022-12-12 12:51:35,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:51:36,619 INFO L130 PetriNetUnfolder]: 10189/16993 cut-off events. [2022-12-12 12:51:36,619 INFO L131 PetriNetUnfolder]: For 6602/6970 co-relation queries the response was YES. [2022-12-12 12:51:36,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37937 conditions, 16993 events. 10189/16993 cut-off events. For 6602/6970 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 130046 event pairs, 4311 based on Foata normal form. 479/15949 useless extension candidates. Maximal degree in co-relation 22197. Up to 12863 conditions per place. [2022-12-12 12:51:36,757 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 63 selfloop transitions, 6 changer transitions 7/255 dead transitions. [2022-12-12 12:51:36,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 255 transitions, 896 flow [2022-12-12 12:51:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 12:51:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 12:51:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2022-12-12 12:51:36,759 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8808567603748326 [2022-12-12 12:51:36,760 INFO L295 CegarLoopForPetriNet]: 214 programPoint places, -4 predicate places. [2022-12-12 12:51:36,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 255 transitions, 896 flow [2022-12-12 12:51:36,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 255 transitions, 894 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-12 12:51:36,762 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 255 transitions, 894 flow [2022-12-12 12:51:36,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:36,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:51:36,763 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:51:36,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 12:51:36,763 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-12 12:51:36,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:51:36,763 INFO L85 PathProgramCache]: Analyzing trace with hash -900941526, now seen corresponding path program 1 times [2022-12-12 12:51:36,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:51:36,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468828349] [2022-12-12 12:51:36,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:51:36,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:51:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:51:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:51:36,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:51:36,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468828349] [2022-12-12 12:51:36,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468828349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:51:36,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:51:36,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 12:51:36,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001786983] [2022-12-12 12:51:36,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:51:36,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 12:51:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:51:36,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 12:51:36,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 12:51:36,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249 [2022-12-12 12:51:36,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 255 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:36,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:51:36,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249 [2022-12-12 12:51:36,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:51:38,571 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([698] L152-->L155: Formula: (and (= (ite (= (mod v_~f2_11~0_16 256) 0) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~f2_11~0=v_~f2_11~0_16} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~f2_11~0=v_~f2_11~0_16} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][259], [5#L102true, 130#L155true, 255#true, 107#L204-4true, 56#L50true, 206#L120-4true, 275#(= ~f2_11~0 0), 272#(= ~f2_3~0 0), 142#L236-4true, 55#L186true]) [2022-12-12 12:51:38,571 INFO L382 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-12-12 12:51:38,571 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-12 12:51:38,571 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-12 12:51:38,572 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-12 12:51:38,572 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L102-->L105: Formula: (and (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (mod v_~f1_2~0_14 256) 0) 1 0) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|)) InVars {~f1_2~0=v_~f1_2~0_14} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, ~f1_2~0=v_~f1_2~0_14, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][232], [40#L148true, 233#L105true, 255#true, 107#L204-4true, 56#L50true, 206#L120-4true, 275#(= ~f2_11~0 0), 272#(= ~f2_3~0 0), 142#L236-4true, 55#L186true]) [2022-12-12 12:51:38,572 INFO L382 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-12-12 12:51:38,572 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-12 12:51:38,572 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-12 12:51:38,572 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-12 12:51:38,572 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][234], [5#L102true, 40#L148true, 156#L189true, 255#true, 107#L204-4true, 56#L50true, 206#L120-4true, 275#(= ~f2_11~0 0), 272#(= ~f2_3~0 0), 142#L236-4true]) [2022-12-12 12:51:38,572 INFO L382 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-12-12 12:51:38,572 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-12 12:51:38,572 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-12 12:51:38,572 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-12 12:51:38,606 INFO L130 PetriNetUnfolder]: 11439/18672 cut-off events. [2022-12-12 12:51:38,607 INFO L131 PetriNetUnfolder]: For 18988/19625 co-relation queries the response was YES. [2022-12-12 12:51:38,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49698 conditions, 18672 events. 11439/18672 cut-off events. For 18988/19625 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 140314 event pairs, 4248 based on Foata normal form. 489/17337 useless extension candidates. Maximal degree in co-relation 47931. Up to 14285 conditions per place. [2022-12-12 12:51:38,878 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 90 selfloop transitions, 8 changer transitions 7/284 dead transitions. [2022-12-12 12:51:38,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 284 transitions, 1286 flow [2022-12-12 12:51:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 12:51:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 12:51:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2022-12-12 12:51:38,880 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8808567603748326 [2022-12-12 12:51:38,881 INFO L295 CegarLoopForPetriNet]: 214 programPoint places, -2 predicate places. [2022-12-12 12:51:38,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 284 transitions, 1286 flow [2022-12-12 12:51:38,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 284 transitions, 1284 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-12 12:51:38,884 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 284 transitions, 1284 flow [2022-12-12 12:51:38,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:38,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:51:38,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:51:38,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 12:51:38,885 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-12 12:51:38,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:51:38,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1501681108, now seen corresponding path program 1 times [2022-12-12 12:51:38,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:51:38,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254713805] [2022-12-12 12:51:38,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:51:38,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:51:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:51:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:51:39,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:51:39,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254713805] [2022-12-12 12:51:39,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254713805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:51:39,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:51:39,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 12:51:39,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388749354] [2022-12-12 12:51:39,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:51:39,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 12:51:39,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:51:39,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 12:51:39,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 12:51:39,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249 [2022-12-12 12:51:39,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 284 transitions, 1284 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:39,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:51:39,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249 [2022-12-12 12:51:39,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:51:41,044 INFO L130 PetriNetUnfolder]: 13425/23029 cut-off events. [2022-12-12 12:51:41,044 INFO L131 PetriNetUnfolder]: For 42463/43069 co-relation queries the response was YES. [2022-12-12 12:51:41,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69318 conditions, 23029 events. 13425/23029 cut-off events. For 42463/43069 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 187431 event pairs, 4170 based on Foata normal form. 708/21295 useless extension candidates. Maximal degree in co-relation 50195. Up to 16298 conditions per place. [2022-12-12 12:51:41,209 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 124 selfloop transitions, 8 changer transitions 7/318 dead transitions. [2022-12-12 12:51:41,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 318 transitions, 1842 flow [2022-12-12 12:51:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 12:51:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 12:51:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2022-12-12 12:51:41,211 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8795180722891566 [2022-12-12 12:51:41,211 INFO L295 CegarLoopForPetriNet]: 214 programPoint places, 0 predicate places. [2022-12-12 12:51:41,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 318 transitions, 1842 flow [2022-12-12 12:51:41,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 318 transitions, 1840 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-12 12:51:41,214 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 318 transitions, 1840 flow [2022-12-12 12:51:41,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:41,215 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:51:41,215 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:51:41,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 12:51:41,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-12 12:51:41,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:51:41,215 INFO L85 PathProgramCache]: Analyzing trace with hash -638841868, now seen corresponding path program 1 times [2022-12-12 12:51:41,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:51:41,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081786741] [2022-12-12 12:51:41,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:51:41,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:51:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:51:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:51:41,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:51:41,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081786741] [2022-12-12 12:51:41,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081786741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:51:41,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:51:41,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 12:51:41,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556540342] [2022-12-12 12:51:41,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:51:41,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 12:51:41,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:51:41,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 12:51:41,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 12:51:41,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249 [2022-12-12 12:51:41,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 318 transitions, 1840 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:41,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:51:41,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249 [2022-12-12 12:51:41,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:51:42,596 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([698] L152-->L155: Formula: (and (= (ite (= (mod v_~f2_11~0_16 256) 0) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~f2_11~0=v_~f2_11~0_16} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~f2_11~0=v_~f2_11~0_16} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][316], [120#L54true, 130#L155true, 278#(= ~f1_10~0 0), 255#true, 107#L204-4true, 206#L120-4true, 196#L182true, 272#(= ~f2_3~0 0), 273#true, 279#true, 142#L236-4true, 23#L81true]) [2022-12-12 12:51:42,596 INFO L382 tUnfolder$Statistics]: this new event has 125 ancestors and is not cut-off event [2022-12-12 12:51:42,596 INFO L385 tUnfolder$Statistics]: existing Event has 125 ancestors and is not cut-off event [2022-12-12 12:51:42,596 INFO L385 tUnfolder$Statistics]: existing Event has 125 ancestors and is not cut-off event [2022-12-12 12:51:42,596 INFO L385 tUnfolder$Statistics]: existing Event has 125 ancestors and is not cut-off event [2022-12-12 12:51:42,613 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([698] L152-->L155: Formula: (and (= (ite (= (mod v_~f2_11~0_16 256) 0) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~f2_11~0=v_~f2_11~0_16} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~f2_11~0=v_~f2_11~0_16} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][333], [130#L155true, 278#(= ~f1_10~0 0), 120#L54true, 255#true, 107#L204-4true, 206#L120-4true, 275#(= ~f2_11~0 0), 272#(= ~f2_3~0 0), 279#true, 142#L236-4true, 55#L186true, 23#L81true]) [2022-12-12 12:51:42,613 INFO L382 tUnfolder$Statistics]: this new event has 126 ancestors and is cut-off event [2022-12-12 12:51:42,613 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-12-12 12:51:42,613 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-12-12 12:51:42,613 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-12-12 12:51:42,664 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([698] L152-->L155: Formula: (and (= (ite (= (mod v_~f2_11~0_16 256) 0) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~f2_11~0=v_~f2_11~0_16} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~f2_11~0=v_~f2_11~0_16} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][316], [120#L54true, 130#L155true, 278#(= ~f1_10~0 0), 255#true, 107#L204-4true, 206#L120-4true, 272#(= ~f2_3~0 0), 273#true, 279#true, 196#L182true, 142#L236-4true, 167#L84true]) [2022-12-12 12:51:42,665 INFO L382 tUnfolder$Statistics]: this new event has 126 ancestors and is not cut-off event [2022-12-12 12:51:42,665 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is not cut-off event [2022-12-12 12:51:42,665 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is not cut-off event [2022-12-12 12:51:42,665 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is not cut-off event [2022-12-12 12:51:42,665 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][332], [120#L54true, 278#(= ~f1_10~0 0), 156#L189true, 110#L152true, 255#true, 107#L204-4true, 206#L120-4true, 275#(= ~f2_11~0 0), 272#(= ~f2_3~0 0), 279#true, 142#L236-4true, 23#L81true]) [2022-12-12 12:51:42,665 INFO L382 tUnfolder$Statistics]: this new event has 126 ancestors and is not cut-off event [2022-12-12 12:51:42,665 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is not cut-off event [2022-12-12 12:51:42,666 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is not cut-off event [2022-12-12 12:51:42,666 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is not cut-off event [2022-12-12 12:51:42,681 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([698] L152-->L155: Formula: (and (= (ite (= (mod v_~f2_11~0_16 256) 0) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~f2_11~0=v_~f2_11~0_16} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~f2_11~0=v_~f2_11~0_16} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][333], [130#L155true, 278#(= ~f1_10~0 0), 120#L54true, 255#true, 107#L204-4true, 206#L120-4true, 275#(= ~f2_11~0 0), 272#(= ~f2_3~0 0), 279#true, 167#L84true, 142#L236-4true, 55#L186true]) [2022-12-12 12:51:42,681 INFO L382 tUnfolder$Statistics]: this new event has 127 ancestors and is cut-off event [2022-12-12 12:51:42,681 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-12 12:51:42,681 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-12 12:51:42,681 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-12 12:51:42,736 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][332], [278#(= ~f1_10~0 0), 120#L54true, 156#L189true, 110#L152true, 255#true, 107#L204-4true, 206#L120-4true, 275#(= ~f2_11~0 0), 272#(= ~f2_3~0 0), 279#true, 142#L236-4true, 167#L84true]) [2022-12-12 12:51:42,736 INFO L382 tUnfolder$Statistics]: this new event has 127 ancestors and is not cut-off event [2022-12-12 12:51:42,736 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is not cut-off event [2022-12-12 12:51:42,736 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is not cut-off event [2022-12-12 12:51:42,736 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is not cut-off event [2022-12-12 12:51:44,105 INFO L130 PetriNetUnfolder]: 15962/28459 cut-off events. [2022-12-12 12:51:44,105 INFO L131 PetriNetUnfolder]: For 86025/87545 co-relation queries the response was YES. [2022-12-12 12:51:44,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94960 conditions, 28459 events. 15962/28459 cut-off events. For 86025/87545 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 246967 event pairs, 5566 based on Foata normal form. 1188/26490 useless extension candidates. Maximal degree in co-relation 92212. Up to 19164 conditions per place. [2022-12-12 12:51:44,313 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 164 selfloop transitions, 10 changer transitions 7/360 dead transitions. [2022-12-12 12:51:44,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 360 transitions, 2634 flow [2022-12-12 12:51:44,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 12:51:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 12:51:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2022-12-12 12:51:44,315 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8795180722891566 [2022-12-12 12:51:44,316 INFO L295 CegarLoopForPetriNet]: 214 programPoint places, 2 predicate places. [2022-12-12 12:51:44,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 360 transitions, 2634 flow [2022-12-12 12:51:44,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 360 transitions, 2632 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-12 12:51:44,320 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 360 transitions, 2632 flow [2022-12-12 12:51:44,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:44,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:51:44,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:51:44,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 12:51:44,321 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-12 12:51:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:51:44,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1441119981, now seen corresponding path program 1 times [2022-12-12 12:51:44,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:51:44,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319092979] [2022-12-12 12:51:44,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:51:44,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:51:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:51:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:51:44,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:51:44,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319092979] [2022-12-12 12:51:44,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319092979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:51:44,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:51:44,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 12:51:44,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352616685] [2022-12-12 12:51:44,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:51:44,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 12:51:44,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:51:44,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 12:51:44,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 12:51:44,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249 [2022-12-12 12:51:44,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 360 transitions, 2632 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:44,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:51:44,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249 [2022-12-12 12:51:44,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:51:45,439 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([637] L54-->L57: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (mod v_~f2_3~0_16 256) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|)) InVars {~f2_3~0=v_~f2_3~0_16} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][181], [107#L204-4true, 276#true, 284#(= ~f1_2~0 1), 151#L57true, 273#true, 211#L88true, 255#true, 7#L172true, 207#L138true, 206#L120-4true, 279#true, 270#true, 142#L236-4true]) [2022-12-12 12:51:45,439 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,440 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,440 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,440 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,440 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([652] L88-->L91: Formula: (and (= (mod v_~f1_2~0_18 256) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0))) InVars {~f1_2~0=v_~f1_2~0_18} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_18, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][182], [120#L54true, 24#L91true, 107#L204-4true, 276#true, 284#(= ~f1_2~0 1), 273#true, 255#true, 7#L172true, 207#L138true, 206#L120-4true, 279#true, 142#L236-4true, 270#true]) [2022-12-12 12:51:45,440 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,440 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,440 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,440 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,441 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([709] L172-->L175: Formula: (and (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_1| 0)) (= (mod v_~f1_10~0_16 256) |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_1| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|)) InVars {~f1_10~0=v_~f1_10~0_16} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f1_10~0=v_~f1_10~0_16} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][339], [120#L54true, 114#L175true, 107#L204-4true, 276#true, 284#(= ~f1_2~0 1), 273#true, 211#L88true, 255#true, 207#L138true, 206#L120-4true, 279#true, 142#L236-4true, 270#true]) [2022-12-12 12:51:45,441 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,441 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,441 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,441 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,441 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([694] L138-->L141: Formula: (and (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (mod v_~f2_11~0_18 256) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|)) InVars {~f2_11~0=v_~f2_11~0_18} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f2_11~0=v_~f2_11~0_18} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][340], [120#L54true, 107#L204-4true, 276#true, 284#(= ~f1_2~0 1), 273#true, 211#L88true, 255#true, 7#L172true, 206#L120-4true, 19#L141true, 279#true, 270#true, 142#L236-4true]) [2022-12-12 12:51:45,441 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,442 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,442 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,442 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:45,651 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([652] L88-->L91: Formula: (and (= (mod v_~f1_2~0_18 256) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0))) InVars {~f1_2~0=v_~f1_2~0_18} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_18, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][317], [120#L54true, 278#(= ~f1_10~0 0), 130#L155true, 24#L91true, 107#L204-4true, 284#(= ~f1_2~0 1), 273#true, 255#true, 7#L172true, 206#L120-4true, 279#true, 142#L236-4true, 270#true]) [2022-12-12 12:51:45,652 INFO L382 tUnfolder$Statistics]: this new event has 125 ancestors and is cut-off event [2022-12-12 12:51:45,652 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-12 12:51:45,652 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-12 12:51:45,652 INFO L385 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-12-12 12:51:45,652 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([637] L54-->L57: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (mod v_~f2_3~0_16 256) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|)) InVars {~f2_3~0=v_~f2_3~0_16} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][318], [278#(= ~f1_10~0 0), 130#L155true, 107#L204-4true, 151#L57true, 284#(= ~f1_2~0 1), 273#true, 211#L88true, 255#true, 7#L172true, 206#L120-4true, 279#true, 142#L236-4true, 270#true]) [2022-12-12 12:51:45,652 INFO L382 tUnfolder$Statistics]: this new event has 125 ancestors and is cut-off event [2022-12-12 12:51:45,652 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-12 12:51:45,652 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-12 12:51:45,652 INFO L385 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-12-12 12:51:45,716 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][315], [120#L54true, 107#L204-4true, 276#true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 40#L148true, 156#L189true, 255#true, 206#L120-4true, 272#(= ~f2_3~0 0), 279#true, 142#L236-4true, 23#L81true]) [2022-12-12 12:51:45,716 INFO L382 tUnfolder$Statistics]: this new event has 125 ancestors and is not cut-off event [2022-12-12 12:51:45,716 INFO L385 tUnfolder$Statistics]: existing Event has 125 ancestors and is not cut-off event [2022-12-12 12:51:45,716 INFO L385 tUnfolder$Statistics]: existing Event has 125 ancestors and is not cut-off event [2022-12-12 12:51:45,716 INFO L385 tUnfolder$Statistics]: existing Event has 125 ancestors and is not cut-off event [2022-12-12 12:51:45,729 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][335], [120#L54true, 278#(= ~f1_10~0 0), 110#L152true, 107#L204-4true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 156#L189true, 255#true, 206#L120-4true, 272#(= ~f2_3~0 0), 279#true, 142#L236-4true, 23#L81true]) [2022-12-12 12:51:45,729 INFO L382 tUnfolder$Statistics]: this new event has 126 ancestors and is cut-off event [2022-12-12 12:51:45,729 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-12-12 12:51:45,729 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-12-12 12:51:45,729 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-12-12 12:51:45,779 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][351], [120#L54true, 107#L204-4true, 276#true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 211#L88true, 40#L148true, 156#L189true, 255#true, 206#L120-4true, 279#true, 142#L236-4true, 270#true]) [2022-12-12 12:51:45,779 INFO L382 tUnfolder$Statistics]: this new event has 127 ancestors and is cut-off event [2022-12-12 12:51:45,779 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-12 12:51:45,779 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-12 12:51:45,779 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-12 12:51:45,781 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][315], [120#L54true, 107#L204-4true, 276#true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 167#L84true, 40#L148true, 156#L189true, 255#true, 206#L120-4true, 272#(= ~f2_3~0 0), 279#true, 142#L236-4true]) [2022-12-12 12:51:45,781 INFO L382 tUnfolder$Statistics]: this new event has 126 ancestors and is not cut-off event [2022-12-12 12:51:45,781 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is not cut-off event [2022-12-12 12:51:45,781 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is not cut-off event [2022-12-12 12:51:45,781 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is not cut-off event [2022-12-12 12:51:45,782 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([698] L152-->L155: Formula: (and (= (ite (= (mod v_~f2_11~0_16 256) 0) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~f2_11~0=v_~f2_11~0_16} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~f2_11~0=v_~f2_11~0_16} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][336], [130#L155true, 278#(= ~f1_10~0 0), 120#L54true, 107#L204-4true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 255#true, 206#L120-4true, 272#(= ~f2_3~0 0), 279#true, 142#L236-4true, 23#L81true, 55#L186true]) [2022-12-12 12:51:45,782 INFO L382 tUnfolder$Statistics]: this new event has 126 ancestors and is not cut-off event [2022-12-12 12:51:45,782 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is not cut-off event [2022-12-12 12:51:45,782 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is not cut-off event [2022-12-12 12:51:45,782 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is not cut-off event [2022-12-12 12:51:45,792 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][335], [278#(= ~f1_10~0 0), 120#L54true, 110#L152true, 107#L204-4true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 167#L84true, 156#L189true, 255#true, 206#L120-4true, 272#(= ~f2_3~0 0), 279#true, 142#L236-4true]) [2022-12-12 12:51:45,792 INFO L382 tUnfolder$Statistics]: this new event has 127 ancestors and is cut-off event [2022-12-12 12:51:45,792 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-12 12:51:45,792 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-12 12:51:45,792 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-12 12:51:45,795 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([652] L88-->L91: Formula: (and (= (mod v_~f1_2~0_18 256) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0))) InVars {~f1_2~0=v_~f1_2~0_18} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_18, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][317], [120#L54true, 278#(= ~f1_10~0 0), 24#L91true, 107#L204-4true, 284#(= ~f1_2~0 1), 155#L131true, 273#true, 255#true, 7#L172true, 206#L120-4true, 279#true, 142#L236-4true, 270#true]) [2022-12-12 12:51:45,795 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is cut-off event [2022-12-12 12:51:45,795 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-12 12:51:45,795 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-12 12:51:45,795 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-12 12:51:45,795 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([637] L54-->L57: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (mod v_~f2_3~0_16 256) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|)) InVars {~f2_3~0=v_~f2_3~0_16} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][318], [278#(= ~f1_10~0 0), 107#L204-4true, 151#L57true, 284#(= ~f1_2~0 1), 273#true, 155#L131true, 211#L88true, 255#true, 7#L172true, 206#L120-4true, 279#true, 142#L236-4true, 270#true]) [2022-12-12 12:51:45,795 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is cut-off event [2022-12-12 12:51:45,795 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-12 12:51:45,796 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-12 12:51:45,796 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-12 12:51:45,853 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([637] L54-->L57: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (mod v_~f2_3~0_16 256) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|)) InVars {~f2_3~0=v_~f2_3~0_16} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][289], [107#L204-4true, 276#true, 151#L57true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 211#L88true, 40#L148true, 255#true, 206#L120-4true, 279#true, 142#L236-4true, 270#true, 55#L186true]) [2022-12-12 12:51:45,853 INFO L382 tUnfolder$Statistics]: this new event has 127 ancestors and is not cut-off event [2022-12-12 12:51:45,853 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is not cut-off event [2022-12-12 12:51:45,853 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is not cut-off event [2022-12-12 12:51:45,854 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is not cut-off event [2022-12-12 12:51:45,854 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([652] L88-->L91: Formula: (and (= (mod v_~f1_2~0_18 256) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0))) InVars {~f1_2~0=v_~f1_2~0_18} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_18, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][290], [120#L54true, 24#L91true, 107#L204-4true, 276#true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 40#L148true, 255#true, 206#L120-4true, 279#true, 142#L236-4true, 270#true, 55#L186true]) [2022-12-12 12:51:45,854 INFO L382 tUnfolder$Statistics]: this new event has 127 ancestors and is not cut-off event [2022-12-12 12:51:45,854 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is not cut-off event [2022-12-12 12:51:45,854 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is not cut-off event [2022-12-12 12:51:45,854 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is not cut-off event [2022-12-12 12:51:45,855 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([698] L152-->L155: Formula: (and (= (ite (= (mod v_~f2_11~0_16 256) 0) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~f2_11~0=v_~f2_11~0_16} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~f2_11~0=v_~f2_11~0_16} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][355], [120#L54true, 130#L155true, 278#(= ~f1_10~0 0), 107#L204-4true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 211#L88true, 255#true, 206#L120-4true, 279#true, 270#true, 142#L236-4true, 55#L186true]) [2022-12-12 12:51:45,855 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is cut-off event [2022-12-12 12:51:45,855 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-12 12:51:45,855 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-12 12:51:45,855 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-12 12:51:45,856 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([698] L152-->L155: Formula: (and (= (ite (= (mod v_~f2_11~0_16 256) 0) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~f2_11~0=v_~f2_11~0_16} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~f2_11~0=v_~f2_11~0_16} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][336], [120#L54true, 130#L155true, 278#(= ~f1_10~0 0), 107#L204-4true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 167#L84true, 255#true, 206#L120-4true, 272#(= ~f2_3~0 0), 279#true, 142#L236-4true, 55#L186true]) [2022-12-12 12:51:45,856 INFO L382 tUnfolder$Statistics]: this new event has 127 ancestors and is not cut-off event [2022-12-12 12:51:45,856 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is not cut-off event [2022-12-12 12:51:45,856 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is not cut-off event [2022-12-12 12:51:45,856 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is not cut-off event [2022-12-12 12:51:45,867 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([748] thread5EXIT-->L205-2: Formula: (and (= v_thread5Thread1of1ForFork2_thidvar0_10 (let ((.cse0 (mod |v_thread4Thread1of1ForFork0_#t~mem15_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_thread5Thread1of1ForFork2_thidvar1_10 0) (= v_thread5Thread1of1ForFork2_thidvar2_10 0) (= v_thread5Thread1of1ForFork2_thidvar3_10 0)) InVars {thread5Thread1of1ForFork2_thidvar2=v_thread5Thread1of1ForFork2_thidvar2_10, thread5Thread1of1ForFork2_thidvar3=v_thread5Thread1of1ForFork2_thidvar3_10, thread5Thread1of1ForFork2_thidvar0=v_thread5Thread1of1ForFork2_thidvar0_10, thread5Thread1of1ForFork2_thidvar1=v_thread5Thread1of1ForFork2_thidvar1_10, thread4Thread1of1ForFork0_#t~mem15=|v_thread4Thread1of1ForFork0_#t~mem15_8|} OutVars{thread5Thread1of1ForFork2_thidvar2=v_thread5Thread1of1ForFork2_thidvar2_10, thread5Thread1of1ForFork2_thidvar3=v_thread5Thread1of1ForFork2_thidvar3_10, thread5Thread1of1ForFork2_thidvar0=v_thread5Thread1of1ForFork2_thidvar0_10, thread5Thread1of1ForFork2_thidvar1=v_thread5Thread1of1ForFork2_thidvar1_10, thread4Thread1of1ForFork0_#t~mem15=|v_thread4Thread1of1ForFork0_#t~mem15_8|} AuxVars[] AssignedVars[][319], [120#L54true, 211#L88true, 278#(= ~f1_10~0 0), 255#true, 7#L172true, 206#L120-4true, 284#(= ~f1_2~0 1), 226#L205-2true, 273#true, 279#true, 270#true, 142#L236-4true]) [2022-12-12 12:51:45,867 INFO L382 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-12-12 12:51:45,867 INFO L385 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-12-12 12:51:45,867 INFO L385 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-12-12 12:51:45,867 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-12 12:51:45,867 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([749] thread5EXIT-->L205-2: Formula: (and (= v_thread5Thread1of1ForFork2_thidvar2_12 0) (= v_thread5Thread1of1ForFork2_thidvar3_12 0) (= v_thread5Thread1of1ForFork2_thidvar0_12 (let ((.cse0 (mod |v_thread4Thread1of1ForFork0_#t~mem15_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread5Thread1of1ForFork2_thidvar1_12 0)) InVars {thread5Thread1of1ForFork2_thidvar2=v_thread5Thread1of1ForFork2_thidvar2_12, thread5Thread1of1ForFork2_thidvar3=v_thread5Thread1of1ForFork2_thidvar3_12, thread5Thread1of1ForFork2_thidvar0=v_thread5Thread1of1ForFork2_thidvar0_12, thread5Thread1of1ForFork2_thidvar1=v_thread5Thread1of1ForFork2_thidvar1_12, thread4Thread1of1ForFork0_#t~mem15=|v_thread4Thread1of1ForFork0_#t~mem15_10|} OutVars{thread5Thread1of1ForFork2_thidvar2=v_thread5Thread1of1ForFork2_thidvar2_12, thread5Thread1of1ForFork2_thidvar3=v_thread5Thread1of1ForFork2_thidvar3_12, thread5Thread1of1ForFork2_thidvar0=v_thread5Thread1of1ForFork2_thidvar0_12, thread5Thread1of1ForFork2_thidvar1=v_thread5Thread1of1ForFork2_thidvar1_12, thread4Thread1of1ForFork0_#t~mem15=|v_thread4Thread1of1ForFork0_#t~mem15_10|} AuxVars[] AssignedVars[][320], [120#L54true, 278#(= ~f1_10~0 0), 211#L88true, 255#true, 7#L172true, 206#L120-4true, 284#(= ~f1_2~0 1), 226#L205-2true, 273#true, 279#true, 142#L236-4true, 270#true]) [2022-12-12 12:51:45,867 INFO L382 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-12-12 12:51:45,867 INFO L385 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-12-12 12:51:45,868 INFO L385 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-12-12 12:51:45,868 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-12 12:51:45,924 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([652] L88-->L91: Formula: (and (= (mod v_~f1_2~0_18 256) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0))) InVars {~f1_2~0=v_~f1_2~0_18} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_18, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][242], [120#L54true, 278#(= ~f1_10~0 0), 24#L91true, 110#L152true, 107#L204-4true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 255#true, 206#L120-4true, 279#true, 142#L236-4true, 270#true, 55#L186true]) [2022-12-12 12:51:45,924 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is not cut-off event [2022-12-12 12:51:45,924 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:45,924 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:45,924 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:45,924 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([637] L54-->L57: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (mod v_~f2_3~0_16 256) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|)) InVars {~f2_3~0=v_~f2_3~0_16} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][243], [278#(= ~f1_10~0 0), 110#L152true, 107#L204-4true, 151#L57true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 211#L88true, 255#true, 206#L120-4true, 279#true, 142#L236-4true, 270#true, 55#L186true]) [2022-12-12 12:51:45,924 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is not cut-off event [2022-12-12 12:51:45,924 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:45,924 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:45,925 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:45,925 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][354], [278#(= ~f1_10~0 0), 120#L54true, 110#L152true, 107#L204-4true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 211#L88true, 156#L189true, 255#true, 206#L120-4true, 279#true, 142#L236-4true, 270#true]) [2022-12-12 12:51:45,925 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is not cut-off event [2022-12-12 12:51:45,925 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:45,925 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:45,925 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:46,771 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][276], [281#(= ~f1_2~0 0), 107#L204-4true, 276#true, 275#(= ~f2_11~0 0), 5#L102true, 40#L148true, 156#L189true, 195#L47true, 255#true, 282#true, 206#L120-4true, 272#(= ~f2_3~0 0), 142#L236-4true]) [2022-12-12 12:51:46,771 INFO L382 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-12-12 12:51:46,771 INFO L385 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-12-12 12:51:46,771 INFO L385 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-12-12 12:51:46,771 INFO L385 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-12-12 12:51:46,771 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L102-->L105: Formula: (and (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (mod v_~f1_2~0_14 256) 0) 1 0) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|)) InVars {~f1_2~0=v_~f1_2~0_14} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, ~f1_2~0=v_~f1_2~0_14, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][334], [281#(= ~f1_2~0 0), 233#L105true, 107#L204-4true, 276#true, 275#(= ~f2_11~0 0), 40#L148true, 195#L47true, 282#true, 255#true, 206#L120-4true, 272#(= ~f2_3~0 0), 142#L236-4true, 55#L186true]) [2022-12-12 12:51:46,771 INFO L382 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-12-12 12:51:46,771 INFO L385 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-12-12 12:51:46,771 INFO L385 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-12-12 12:51:46,772 INFO L385 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-12-12 12:51:46,815 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][276], [281#(= ~f1_2~0 0), 107#L204-4true, 276#true, 56#L50true, 275#(= ~f2_11~0 0), 5#L102true, 40#L148true, 156#L189true, 255#true, 282#true, 206#L120-4true, 272#(= ~f2_3~0 0), 142#L236-4true]) [2022-12-12 12:51:46,815 INFO L382 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,815 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,815 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,815 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,816 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][315], [120#L54true, 107#L204-4true, 276#true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 5#L102true, 40#L148true, 156#L189true, 255#true, 206#L120-4true, 272#(= ~f2_3~0 0), 279#true, 142#L236-4true]) [2022-12-12 12:51:46,816 INFO L382 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-12-12 12:51:46,816 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-12 12:51:46,816 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-12 12:51:46,816 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-12 12:51:46,816 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L102-->L105: Formula: (and (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (mod v_~f1_2~0_14 256) 0) 1 0) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|)) InVars {~f1_2~0=v_~f1_2~0_14} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, ~f1_2~0=v_~f1_2~0_14, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][334], [281#(= ~f1_2~0 0), 233#L105true, 107#L204-4true, 276#true, 56#L50true, 275#(= ~f2_11~0 0), 40#L148true, 282#true, 255#true, 206#L120-4true, 272#(= ~f2_3~0 0), 142#L236-4true, 55#L186true]) [2022-12-12 12:51:46,816 INFO L382 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,816 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,816 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,816 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,818 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L102-->L105: Formula: (and (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (mod v_~f1_2~0_14 256) 0) 1 0) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|)) InVars {~f1_2~0=v_~f1_2~0_14} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, ~f1_2~0=v_~f1_2~0_14, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][292], [281#(= ~f1_2~0 0), 278#(= ~f1_10~0 0), 110#L152true, 233#L105true, 107#L204-4true, 275#(= ~f2_11~0 0), 195#L47true, 255#true, 282#true, 206#L120-4true, 272#(= ~f2_3~0 0), 142#L236-4true, 55#L186true]) [2022-12-12 12:51:46,818 INFO L382 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,818 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,818 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,818 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,818 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([698] L152-->L155: Formula: (and (= (ite (= (mod v_~f2_11~0_16 256) 0) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~f2_11~0=v_~f2_11~0_16} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~f2_11~0=v_~f2_11~0_16} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][300], [281#(= ~f1_2~0 0), 278#(= ~f1_10~0 0), 130#L155true, 107#L204-4true, 275#(= ~f2_11~0 0), 5#L102true, 195#L47true, 255#true, 282#true, 206#L120-4true, 272#(= ~f2_3~0 0), 142#L236-4true, 55#L186true]) [2022-12-12 12:51:46,818 INFO L382 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,818 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,818 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,819 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,819 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][301], [281#(= ~f1_2~0 0), 278#(= ~f1_10~0 0), 110#L152true, 107#L204-4true, 275#(= ~f2_11~0 0), 5#L102true, 156#L189true, 195#L47true, 255#true, 282#true, 206#L120-4true, 272#(= ~f2_3~0 0), 142#L236-4true]) [2022-12-12 12:51:46,819 INFO L382 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,819 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,819 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,819 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-12 12:51:46,856 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L102-->L105: Formula: (and (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (mod v_~f1_2~0_14 256) 0) 1 0) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|)) InVars {~f1_2~0=v_~f1_2~0_14} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, ~f1_2~0=v_~f1_2~0_14, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][292], [278#(= ~f1_10~0 0), 281#(= ~f1_2~0 0), 110#L152true, 233#L105true, 107#L204-4true, 56#L50true, 275#(= ~f2_11~0 0), 255#true, 282#true, 206#L120-4true, 272#(= ~f2_3~0 0), 142#L236-4true, 55#L186true]) [2022-12-12 12:51:46,856 INFO L382 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-12-12 12:51:46,856 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-12 12:51:46,856 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-12 12:51:46,856 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-12 12:51:46,857 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([698] L152-->L155: Formula: (and (= (ite (= (mod v_~f2_11~0_16 256) 0) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~f2_11~0=v_~f2_11~0_16} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~f2_11~0=v_~f2_11~0_16} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][300], [278#(= ~f1_10~0 0), 130#L155true, 281#(= ~f1_2~0 0), 107#L204-4true, 56#L50true, 275#(= ~f2_11~0 0), 5#L102true, 282#true, 255#true, 206#L120-4true, 272#(= ~f2_3~0 0), 142#L236-4true, 55#L186true]) [2022-12-12 12:51:46,857 INFO L382 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-12-12 12:51:46,857 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-12 12:51:46,857 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-12 12:51:46,857 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-12 12:51:46,857 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][335], [120#L54true, 278#(= ~f1_10~0 0), 110#L152true, 107#L204-4true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 5#L102true, 156#L189true, 255#true, 206#L120-4true, 272#(= ~f2_3~0 0), 279#true, 142#L236-4true]) [2022-12-12 12:51:46,857 INFO L382 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-12-12 12:51:46,857 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-12 12:51:46,857 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-12 12:51:46,857 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-12 12:51:46,857 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][301], [281#(= ~f1_2~0 0), 278#(= ~f1_10~0 0), 110#L152true, 107#L204-4true, 56#L50true, 275#(= ~f2_11~0 0), 5#L102true, 156#L189true, 255#true, 282#true, 206#L120-4true, 272#(= ~f2_3~0 0), 142#L236-4true]) [2022-12-12 12:51:46,857 INFO L382 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-12-12 12:51:46,857 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-12 12:51:46,857 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-12 12:51:46,857 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-12 12:51:46,858 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([698] L152-->L155: Formula: (and (= (ite (= (mod v_~f2_11~0_16 256) 0) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~f2_11~0=v_~f2_11~0_16} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~f2_11~0=v_~f2_11~0_16} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][336], [130#L155true, 278#(= ~f1_10~0 0), 120#L54true, 107#L204-4true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 5#L102true, 255#true, 206#L120-4true, 272#(= ~f2_3~0 0), 279#true, 142#L236-4true, 55#L186true]) [2022-12-12 12:51:46,858 INFO L382 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-12-12 12:51:46,858 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-12 12:51:46,858 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-12 12:51:46,858 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-12 12:51:47,025 INFO L130 PetriNetUnfolder]: 14109/25885 cut-off events. [2022-12-12 12:51:47,025 INFO L131 PetriNetUnfolder]: For 112063/114173 co-relation queries the response was YES. [2022-12-12 12:51:47,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95543 conditions, 25885 events. 14109/25885 cut-off events. For 112063/114173 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 226452 event pairs, 4894 based on Foata normal form. 1589/24655 useless extension candidates. Maximal degree in co-relation 51580. Up to 16968 conditions per place. [2022-12-12 12:51:47,193 INFO L137 encePairwiseOnDemand]: 246/249 looper letters, 182 selfloop transitions, 2 changer transitions 7/370 dead transitions. [2022-12-12 12:51:47,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 370 transitions, 3130 flow [2022-12-12 12:51:47,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 12:51:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 12:51:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2022-12-12 12:51:47,195 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8781793842034806 [2022-12-12 12:51:47,196 INFO L295 CegarLoopForPetriNet]: 214 programPoint places, 4 predicate places. [2022-12-12 12:51:47,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 370 transitions, 3130 flow [2022-12-12 12:51:47,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 370 transitions, 2820 flow, removed 155 selfloop flow, removed 0 redundant places. [2022-12-12 12:51:47,209 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 370 transitions, 2820 flow [2022-12-12 12:51:47,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:47,209 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:51:47,209 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:51:47,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 12:51:47,209 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-12 12:51:47,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:51:47,210 INFO L85 PathProgramCache]: Analyzing trace with hash -471383960, now seen corresponding path program 1 times [2022-12-12 12:51:47,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:51:47,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929868047] [2022-12-12 12:51:47,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:51:47,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:51:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:51:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:51:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:51:47,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929868047] [2022-12-12 12:51:47,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929868047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:51:47,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:51:47,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 12:51:47,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631048500] [2022-12-12 12:51:47,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:51:47,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 12:51:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:51:47,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 12:51:47,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 12:51:47,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249 [2022-12-12 12:51:47,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 370 transitions, 2820 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:47,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:51:47,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249 [2022-12-12 12:51:47,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:51:48,055 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([652] L88-->L91: Formula: (and (= (mod v_~f1_2~0_18 256) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0))) InVars {~f1_2~0=v_~f1_2~0_18} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_18, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][181], [120#L54true, 24#L91true, 107#L204-4true, 276#true, 284#(= ~f1_2~0 1), 273#true, 255#true, 7#L172true, 206#L120-4true, 207#L138true, 279#true, 142#L236-4true, 270#true, 287#(= ~f2_3~0 1)]) [2022-12-12 12:51:48,055 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,055 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,055 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,055 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,056 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([637] L54-->L57: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (mod v_~f2_3~0_16 256) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|)) InVars {~f2_3~0=v_~f2_3~0_16} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][183], [107#L204-4true, 276#true, 151#L57true, 284#(= ~f1_2~0 1), 273#true, 211#L88true, 255#true, 7#L172true, 206#L120-4true, 207#L138true, 279#true, 142#L236-4true, 270#true, 287#(= ~f2_3~0 1)]) [2022-12-12 12:51:48,056 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,056 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,056 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,056 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,056 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([694] L138-->L141: Formula: (and (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (mod v_~f2_11~0_18 256) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|)) InVars {~f2_11~0=v_~f2_11~0_18} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f2_11~0=v_~f2_11~0_18} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][336], [120#L54true, 107#L204-4true, 276#true, 284#(= ~f1_2~0 1), 273#true, 211#L88true, 255#true, 7#L172true, 206#L120-4true, 19#L141true, 279#true, 142#L236-4true, 270#true, 287#(= ~f2_3~0 1)]) [2022-12-12 12:51:48,056 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,056 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,056 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,056 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,057 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([709] L172-->L175: Formula: (and (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_1| 0)) (= (mod v_~f1_10~0_16 256) |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_1| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|)) InVars {~f1_10~0=v_~f1_10~0_16} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f1_10~0=v_~f1_10~0_16} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][337], [120#L54true, 114#L175true, 107#L204-4true, 276#true, 284#(= ~f1_2~0 1), 273#true, 211#L88true, 255#true, 206#L120-4true, 207#L138true, 279#true, 142#L236-4true, 270#true, 287#(= ~f2_3~0 1)]) [2022-12-12 12:51:48,057 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,057 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,057 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,057 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is not cut-off event [2022-12-12 12:51:48,523 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([652] L88-->L91: Formula: (and (= (mod v_~f1_2~0_18 256) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0))) InVars {~f1_2~0=v_~f1_2~0_18} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_18, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][316], [120#L54true, 278#(= ~f1_10~0 0), 24#L91true, 107#L204-4true, 284#(= ~f1_2~0 1), 155#L131true, 273#true, 255#true, 7#L172true, 206#L120-4true, 279#true, 142#L236-4true, 270#true, 287#(= ~f2_3~0 1)]) [2022-12-12 12:51:48,523 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is cut-off event [2022-12-12 12:51:48,523 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-12 12:51:48,523 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-12 12:51:48,523 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-12 12:51:48,523 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([637] L54-->L57: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (mod v_~f2_3~0_16 256) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|)) InVars {~f2_3~0=v_~f2_3~0_16} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][317], [278#(= ~f1_10~0 0), 107#L204-4true, 151#L57true, 284#(= ~f1_2~0 1), 155#L131true, 273#true, 211#L88true, 255#true, 7#L172true, 206#L120-4true, 279#true, 142#L236-4true, 270#true, 287#(= ~f2_3~0 1)]) [2022-12-12 12:51:48,523 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is cut-off event [2022-12-12 12:51:48,523 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-12 12:51:48,524 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-12 12:51:48,524 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-12 12:51:48,563 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L186-->L189: Formula: (and (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|) (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3| (ite (= (mod v_~f1_10~0_18 256) 0) 1 0)) (not (= |v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3| 0))) InVars {~f1_10~0=v_~f1_10~0_18} OutVars{thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1_3|, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_3|, ~f1_10~0=v_~f1_10~0_18} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork5_assume_abort_if_not_#in~cond#1][351], [120#L54true, 278#(= ~f1_10~0 0), 110#L152true, 107#L204-4true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 211#L88true, 156#L189true, 255#true, 206#L120-4true, 279#true, 142#L236-4true, 270#true, 287#(= ~f2_3~0 1)]) [2022-12-12 12:51:48,563 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is cut-off event [2022-12-12 12:51:48,563 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-12 12:51:48,563 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-12 12:51:48,563 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-12 12:51:48,616 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([637] L54-->L57: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (mod v_~f2_3~0_16 256) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|)) InVars {~f2_3~0=v_~f2_3~0_16} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][241], [278#(= ~f1_10~0 0), 110#L152true, 107#L204-4true, 151#L57true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 211#L88true, 255#true, 206#L120-4true, 279#true, 270#true, 142#L236-4true, 287#(= ~f2_3~0 1), 55#L186true]) [2022-12-12 12:51:48,616 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is not cut-off event [2022-12-12 12:51:48,616 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:48,617 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:48,617 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:48,617 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([652] L88-->L91: Formula: (and (= (mod v_~f1_2~0_18 256) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0))) InVars {~f1_2~0=v_~f1_2~0_18} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_18, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][242], [120#L54true, 278#(= ~f1_10~0 0), 24#L91true, 110#L152true, 107#L204-4true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 255#true, 206#L120-4true, 279#true, 142#L236-4true, 270#true, 287#(= ~f2_3~0 1), 55#L186true]) [2022-12-12 12:51:48,617 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is not cut-off event [2022-12-12 12:51:48,617 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:48,617 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:48,617 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:48,618 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([698] L152-->L155: Formula: (and (= (ite (= (mod v_~f2_11~0_16 256) 0) 1 0) |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= |v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (not (= 0 |v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))) InVars {~f2_11~0=v_~f2_11~0_16} OutVars{thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~f2_11~0=v_~f2_11~0_16} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork2_assume_abort_if_not_~cond#1][350], [120#L54true, 130#L155true, 278#(= ~f1_10~0 0), 107#L204-4true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 211#L88true, 255#true, 206#L120-4true, 279#true, 142#L236-4true, 270#true, 287#(= ~f2_3~0 1), 55#L186true]) [2022-12-12 12:51:48,618 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is not cut-off event [2022-12-12 12:51:48,618 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:48,618 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:48,618 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is not cut-off event [2022-12-12 12:51:48,985 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([652] L88-->L91: Formula: (and (= (mod v_~f1_2~0_18 256) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0))) InVars {~f1_2~0=v_~f1_2~0_18} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_18, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][242], [278#(= ~f1_10~0 0), 120#L54true, 24#L91true, 107#L204-4true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 155#L131true, 255#true, 206#L120-4true, 93#L168true, 279#true, 270#true, 142#L236-4true, 287#(= ~f2_3~0 1)]) [2022-12-12 12:51:48,986 INFO L382 tUnfolder$Statistics]: this new event has 137 ancestors and is cut-off event [2022-12-12 12:51:48,986 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-12 12:51:48,986 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-12 12:51:48,986 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-12 12:51:48,986 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([637] L54-->L57: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (mod v_~f2_3~0_16 256) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|)) InVars {~f2_3~0=v_~f2_3~0_16} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][241], [278#(= ~f1_10~0 0), 107#L204-4true, 151#L57true, 284#(= ~f1_2~0 1), 275#(= ~f2_11~0 0), 155#L131true, 211#L88true, 255#true, 206#L120-4true, 93#L168true, 279#true, 142#L236-4true, 270#true, 287#(= ~f2_3~0 1)]) [2022-12-12 12:51:48,986 INFO L382 tUnfolder$Statistics]: this new event has 137 ancestors and is cut-off event [2022-12-12 12:51:48,986 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-12 12:51:48,986 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-12 12:51:48,986 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-12 12:51:49,331 INFO L130 PetriNetUnfolder]: 10920/20264 cut-off events. [2022-12-12 12:51:49,331 INFO L131 PetriNetUnfolder]: For 89589/91737 co-relation queries the response was YES. [2022-12-12 12:51:49,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75810 conditions, 20264 events. 10920/20264 cut-off events. For 89589/91737 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 173811 event pairs, 3687 based on Foata normal form. 1579/19666 useless extension candidates. Maximal degree in co-relation 38189. Up to 13283 conditions per place. [2022-12-12 12:51:49,463 INFO L137 encePairwiseOnDemand]: 246/249 looper letters, 170 selfloop transitions, 2 changer transitions 15/366 dead transitions. [2022-12-12 12:51:49,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 366 transitions, 3134 flow [2022-12-12 12:51:49,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 12:51:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 12:51:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2022-12-12 12:51:49,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8795180722891566 [2022-12-12 12:51:49,465 INFO L295 CegarLoopForPetriNet]: 214 programPoint places, 6 predicate places. [2022-12-12 12:51:49,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 366 transitions, 3134 flow [2022-12-12 12:51:49,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 366 transitions, 2812 flow, removed 161 selfloop flow, removed 0 redundant places. [2022-12-12 12:51:49,492 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 366 transitions, 2812 flow [2022-12-12 12:51:49,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:51:49,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:51:49,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:51:49,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 12:51:49,492 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-12 12:51:49,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:51:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash -319029144, now seen corresponding path program 1 times [2022-12-12 12:51:49,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:51:49,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45984493] [2022-12-12 12:51:49,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:51:49,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:51:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 12:51:49,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 12:51:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 12:51:49,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 12:51:49,676 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 12:51:49,677 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2022-12-12 12:51:49,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 11 remaining) [2022-12-12 12:51:49,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 11 remaining) [2022-12-12 12:51:49,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 11 remaining) [2022-12-12 12:51:49,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 11 remaining) [2022-12-12 12:51:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2022-12-12 12:51:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2022-12-12 12:51:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 11 remaining) [2022-12-12 12:51:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork4Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 11 remaining) [2022-12-12 12:51:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 11 remaining) [2022-12-12 12:51:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 11 remaining) [2022-12-12 12:51:49,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 12:51:49,683 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:51:49,688 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 12:51:49,688 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 12:51:49,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 12:51:49 BasicIcfg [2022-12-12 12:51:49,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 12:51:49,807 INFO L158 Benchmark]: Toolchain (without parser) took 19394.88ms. Allocated memory was 216.0MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 175.8MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-12 12:51:49,807 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 216.0MB. Free memory was 192.1MB in the beginning and 192.0MB in the end (delta: 83.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 12:51:49,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.86ms. Allocated memory is still 216.0MB. Free memory was 175.3MB in the beginning and 155.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-12 12:51:49,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.66ms. Allocated memory is still 216.0MB. Free memory was 155.4MB in the beginning and 153.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 12:51:49,808 INFO L158 Benchmark]: Boogie Preprocessor took 36.47ms. Allocated memory is still 216.0MB. Free memory was 153.3MB in the beginning and 151.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 12:51:49,808 INFO L158 Benchmark]: RCFGBuilder took 513.05ms. Allocated memory is still 216.0MB. Free memory was 151.2MB in the beginning and 123.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 12:51:49,808 INFO L158 Benchmark]: TraceAbstraction took 18486.07ms. Allocated memory was 216.0MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 122.9MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-12 12:51:49,810 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.11ms. Allocated memory is still 216.0MB. Free memory was 192.1MB in the beginning and 192.0MB in the end (delta: 83.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.86ms. Allocated memory is still 216.0MB. Free memory was 175.3MB in the beginning and 155.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.66ms. Allocated memory is still 216.0MB. Free memory was 155.4MB in the beginning and 153.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.47ms. Allocated memory is still 216.0MB. Free memory was 153.3MB in the beginning and 151.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 513.05ms. Allocated memory is still 216.0MB. Free memory was 151.2MB in the beginning and 123.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 18486.07ms. Allocated memory was 216.0MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 122.9MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 241]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] 0 unsigned int x_0, y_1, x_8, y_9; VAL [x_0=0, x_8=0, y_1=0, y_9=0] [L39] 0 _Bool f1_2, f2_3, f1_10, f2_11; VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, x_0=0, x_8=0, y_1=0, y_9=0] [L40] 0 unsigned int temp_4, temp_5, temp_6, temp_7, temp_12, temp_13, temp_14, temp_15; VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=0, x_8=0, y_1=0, y_9=0] [L212] 0 pthread_t t1, t4; VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=0, x_8=0, y_1=0, y_9=0] [L215] 0 x_0 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294967303, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=4294967303, x_8=0, y_1=0, y_9=0] [L216] 0 y_1 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294967304, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=4294967303, x_8=0, y_1=4294967304, y_9=0] [L217] 0 x_8 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=7, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=4294967303, x_8=7, y_1=4294967304, y_9=0] [L218] 0 y_9 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=8, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L219] 0 temp_4 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294967312, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=4294967312, temp_5=0, temp_6=0, temp_7=0, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L220] 0 temp_5 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294967316, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=4294967312, temp_5=4294967316, temp_6=0, temp_7=0, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L221] 0 temp_6 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294967307, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=0, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L222] 0 temp_7 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294967314, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L223] 0 temp_12 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294967308, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=0, temp_14=0, temp_15=0, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L224] 0 temp_13 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294967315, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=0, temp_15=0, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L225] 0 temp_14 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294967310, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=0, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L226] 0 temp_15 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294967317, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L227] 0 f1_2 = __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=4294967313, f1_10=0, f1_2=4294967313, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L228] 0 f2_3 = __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=4294967309, f1_10=0, f1_2=4294967313, f2_11=0, f2_3=4294967309, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L229] 0 f1_10 = __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=4294967311, f1_10=4294967311, f1_2=4294967313, f2_11=0, f2_3=4294967309, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L230] 0 f2_11 = __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=4294967318, f1_10=4294967311, f1_2=4294967313, f2_11=4294967318, f2_3=4294967309, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L233] CALL 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L35] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, f1_10=4294967311, f1_2=4294967313, f2_11=4294967318, f2_3=4294967309, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L233] RET 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L235] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [f1_10=4294967311, f1_2=4294967313, f2_11=4294967318, f2_3=4294967309, pthread_create(&t1, 0, thread1, 0)=-4, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L112] 1 pthread_t t2, t3; VAL [f1_10=4294967311, f1_2=4294967313, f2_11=4294967318, f2_3=4294967309, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L115] 1 f1_2 = 0 [L116] 1 f2_3 = 0 VAL [f1_10=4294967311, f1_2=0, f2_11=4294967318, f2_3=0, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L119] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [f1_10=4294967311, f1_2=0, f2_11=4294967318, f2_3=0, pthread_create(&t2, 0, thread2, 0)=-3, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L120] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [f1_10=4294967311, f1_2=0, f2_11=4294967318, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L78] COND TRUE 3 __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=1, f1_10=4294967311, f1_2=0, f2_11=4294967318, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967307, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L80] 3 temp_6 = y_1 VAL [f1_10=4294967311, f1_2=0, f2_11=4294967318, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L236] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [f1_10=4294967311, f1_2=0, f2_11=4294967318, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, pthread_create(&t4, 0, thread4, 0)=-1, t1={5:0}, t2={9:0}, t3={10:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L196] 4 pthread_t t5, t6; VAL [f1_10=4294967311, f1_2=0, f2_11=4294967318, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L199] 4 f1_10 = 0 [L200] 4 f2_11 = 0 VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L203] FCALL, FORK 4 pthread_create(&t5, 0, thread5, 0) VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, pthread_create(&t5, 0, thread5, 0)=0, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L44] COND TRUE 2 __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=1, f1_10=0, f1_2=0, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, pthread_create(&t6, 0, thread6, 0)=1, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967312, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L46] 2 temp_4 = x_0 VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, pthread_create(&t6, 0, thread6, 0)=1, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967303, x_8=7, y_1=4294967304, y_9=8] [L49] 2 x_0 = temp_4 + 1 VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, pthread_create(&t6, 0, thread6, 0)=1, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L204] FCALL, FORK 4 pthread_create(&t6, 0, thread6, 0) VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, pthread_create(&t6, 0, thread6, 0)=1, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L205] 4 \read(t5) VAL [\read(t5)=0, f1_10=0, f1_2=0, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L128] COND FALSE 5 !(__VERIFIER_nondet_bool()) VAL [\read(t5)=0, __VERIFIER_nondet_bool()=0, f1_10=0, f1_2=0, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L158] 5 return 0; VAL [\read(t5)=0, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L205] FCALL, JOIN 5 pthread_join(t5, 0) VAL [\read(t5)=0, f1_10=0, f1_2=0, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L53] 2 f1_2 = 1 VAL [\read(t5)=0, f1_10=0, f1_2=1, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L162] COND FALSE 6 !(__VERIFIER_nondet_bool()) VAL [\read(t5)=0, __VERIFIER_nondet_bool()=0, f1_10=0, f1_2=1, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L192] 6 return 0; VAL [\read(t5)=0, \result={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L206] 4 \read(t6) VAL [\read(t6)=1, f1_10=0, f1_2=1, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L206] FCALL, JOIN 6 pthread_join(t6, 0) VAL [\read(t6)=1, f1_10=0, f1_2=1, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L208] 4 return 0; VAL [\result={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, t5={11:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L208] 4 return 0; VAL [\result={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, t6={3:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L208] 4 return 0; VAL [\result={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967304, y_9=8] [L83] 3 y_1 = temp_6 + 1 VAL [\result={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967305, y_9=8] [L87] 3 f2_3 = 1 VAL [\result={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=1, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967316, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967305, y_9=8] [L56] CALL 2 assume_abort_if_not(f2_3) [L35] COND FALSE 2 !(!cond) [L56] RET 2 assume_abort_if_not(f2_3) [L60] 2 temp_5 = y_1 VAL [\result={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=1, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967305, y_9=8] [L63] 2 y_1 = temp_5 + 1 VAL [\result={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=1, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967306, y_9=8] [L90] CALL 3 assume_abort_if_not(f1_2) [L35] COND FALSE 3 !(!cond) [L90] RET 3 assume_abort_if_not(f1_2) [L67] 2 f1_2 = 0 VAL [\result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967314, x_0=4294967304, x_8=7, y_1=4294967306, y_9=8] [L94] 3 temp_7 = x_0 VAL [\result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967304, x_8=7, y_1=4294967306, y_9=8] [L97] 3 x_0 = temp_7 + 1 VAL [\result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L101] 3 f2_3 = 0 VAL [\result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L104] CALL 3 assume_abort_if_not(!f1_2) [L35] COND FALSE 3 !(!cond) [L104] RET 3 assume_abort_if_not(!f1_2) [L70] CALL 2 assume_abort_if_not(!f2_3) [L35] COND FALSE 2 !(!cond) [L70] RET 2 assume_abort_if_not(!f2_3) [L44] COND FALSE 2 !(__VERIFIER_nondet_bool()) VAL [\result={0:0}, __VERIFIER_nondet_bool()=0, f1_10=0, f1_2=0, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L74] 2 return 0; VAL [\result={0:0}, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, pthread_create(&t3, 0, thread3, 0)=-2, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L121] 1 \read(t2) VAL [\read(t2)=-3, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L121] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=-3, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L122] 1 \read(t3) VAL [\read(t3)=-2, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L78] COND FALSE 3 !(__VERIFIER_nondet_bool()) VAL [\read(t3)=-2, \result={0:0}, __VERIFIER_nondet_bool()=0, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L108] 3 return 0; VAL [\read(t3)=-2, \result={0:0}, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L122] FCALL, JOIN 3 pthread_join(t3, 0) VAL [\read(t3)=-2, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L124] 1 return 0; VAL [\result={0:0}, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2={9:0}, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L124] 1 return 0; VAL [\result={0:0}, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t3={10:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L124] 1 return 0; VAL [\result={0:0}, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L237] 0 \read(t1) VAL [\read(t1)=-4, \result={0:0}, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L237] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=-4, \result={0:0}, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L238] 0 \read(t4) VAL [\read(t4)=-1, \result={0:0}, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L238] FCALL, JOIN 4 pthread_join(t4, 0) VAL [\read(t4)=-1, \result={0:0}, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L240] CALL 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L35] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \old(cond)=1, \old(cond)=1, \result={0:0}, \result={0:0}, cond=1, cond=1, cond=1, f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] [L240] RET 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L241] 0 reach_error() VAL [\result={0:0}, \result={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1={5:0}, t4={6:0}, temp_12=4294967308, temp_13=4294967315, temp_14=4294967310, temp_15=4294967317, temp_4=4294967303, temp_5=4294967305, temp_6=4294967304, temp_7=4294967304, x_0=4294967305, x_8=7, y_1=4294967306, y_9=8] - UnprovableResult [Line: 119]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 235]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 236]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 204]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 203]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 203]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 204]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 332 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 604 IncrementalHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 48 mSDtfsCounter, 604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2820occurred in iteration=7, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 783 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1509 NumberOfCodeBlocks, 1509 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 4428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 12:51:49,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...