/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/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 12:00:42,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 12:00:42,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 12:00:42,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 12:00:42,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 12:00:42,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 12:00:42,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 12:00:42,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 12:00:42,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 12:00:42,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 12:00:42,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 12:00:42,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 12:00:42,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 12:00:42,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 12:00:42,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 12:00:42,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 12:00:42,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 12:00:42,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 12:00:42,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 12:00:42,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 12:00:42,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 12:00:42,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 12:00:42,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 12:00:42,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 12:00:42,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 12:00:42,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 12:00:42,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 12:00:42,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 12:00:42,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 12:00:42,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 12:00:42,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 12:00:42,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 12:00:42,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 12:00:42,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 12:00:42,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 12:00:42,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 12:00:42,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 12:00:42,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 12:00:42,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 12:00:42,669 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 12:00:42,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 12:00:42,675 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:00:42,709 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 12:00:42,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 12:00:42,711 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 12:00:42,711 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 12:00:42,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 12:00:42,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 12:00:42,712 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 12:00:42,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 12:00:42,713 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 12:00:42,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 12:00:42,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 12:00:42,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 12:00:42,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 12:00:42,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 12:00:42,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 12:00:42,714 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 12:00:42,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 12:00:42,715 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 12:00:42,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 12:00:42,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 12:00:42,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 12:00:42,715 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 12:00:42,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 12:00:42,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:00:42,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 12:00:42,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 12:00:42,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 12:00:42,716 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 12:00:42,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 12:00:42,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 12:00:42,717 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 12:00:42,717 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:00:43,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 12:00:43,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 12:00:43,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 12:00:43,067 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 12:00:43,067 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 12:00:43,068 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 12:00:44,264 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 12:00:44,527 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 12:00:44,528 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 12:00:44,540 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9950866/5b8f6d7240c14e07a344d21c000e01ad/FLAGaa175c036 [2022-12-12 12:00:44,555 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9950866/5b8f6d7240c14e07a344d21c000e01ad [2022-12-12 12:00:44,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 12:00:44,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 12:00:44,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 12:00:44,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 12:00:44,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 12:00:44,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:00:44" (1/1) ... [2022-12-12 12:00:44,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4272b05c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:44, skipping insertion in model container [2022-12-12 12:00:44,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:00:44" (1/1) ... [2022-12-12 12:00:44,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 12:00:44,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 12:00:44,772 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-12 12:00:44,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:44,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:44,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:44,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:44,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:44,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:44,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:44,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:44,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:44,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:44,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:44,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:44,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:44,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:44,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:00:45,023 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 12:00:45,035 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-12 12:00:45,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:45,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:45,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:00:45,154 INFO L208 MainTranslator]: Completed translation [2022-12-12 12:00:45,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:45 WrapperNode [2022-12-12 12:00:45,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 12:00:45,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 12:00:45,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 12:00:45,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 12:00:45,163 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:00:45" (1/1) ... [2022-12-12 12:00:45,193 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:00:45" (1/1) ... [2022-12-12 12:00:45,227 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-12 12:00:45,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 12:00:45,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 12:00:45,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 12:00:45,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 12:00:45,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:45" (1/1) ... [2022-12-12 12:00:45,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:45" (1/1) ... [2022-12-12 12:00:45,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:45" (1/1) ... [2022-12-12 12:00:45,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:45" (1/1) ... [2022-12-12 12:00:45,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:45" (1/1) ... [2022-12-12 12:00:45,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:45" (1/1) ... [2022-12-12 12:00:45,270 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:45" (1/1) ... [2022-12-12 12:00:45,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:45" (1/1) ... [2022-12-12 12:00:45,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 12:00:45,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 12:00:45,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 12:00:45,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 12:00:45,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:45" (1/1) ... [2022-12-12 12:00:45,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:00:45,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 12:00:45,329 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:00:45,358 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:00:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 12:00:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 12:00:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 12:00:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 12:00:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 12:00:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 12:00:45,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 12:00:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 12:00:45,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 12:00:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 12:00:45,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 12:00:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 12:00:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 12:00:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 12:00:45,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 12:00:45,423 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:00:45,636 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 12:00:45,638 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 12:00:46,049 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 12:00:46,226 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 12:00:46,226 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 12:00:46,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:00:46 BoogieIcfgContainer [2022-12-12 12:00:46,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 12:00:46,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 12:00:46,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 12:00:46,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 12:00:46,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 12:00:44" (1/3) ... [2022-12-12 12:00:46,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee9a2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:00:46, skipping insertion in model container [2022-12-12 12:00:46,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:45" (2/3) ... [2022-12-12 12:00:46,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee9a2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:00:46, skipping insertion in model container [2022-12-12 12:00:46,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:00:46" (3/3) ... [2022-12-12 12:00:46,238 INFO L112 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 12:00:46,272 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 12:00:46,273 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 12:00:46,273 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 12:00:46,536 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 12:00:46,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-12 12:00:46,658 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-12 12:00:46,659 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 12:00:46,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 12:00:46,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-12 12:00:46,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-12 12:00:46,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 12:00:46,724 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;@5f4e6a52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 12:00:46,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 12:00:46,762 INFO L130 PetriNetUnfolder]: 0/56 cut-off events. [2022-12-12 12:00:46,763 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 12:00:46,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:46,764 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] [2022-12-12 12:00:46,765 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:46,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:46,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1223185781, now seen corresponding path program 1 times [2022-12-12 12:00:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:46,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716721644] [2022-12-12 12:00:46,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:46,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:47,657 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:00:47,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:47,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716721644] [2022-12-12 12:00:47,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716721644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:47,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:47,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 12:00:47,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338038214] [2022-12-12 12:00:47,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:47,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 12:00:47,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 12:00:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 12:00:47,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 107 [2022-12-12 12:00:47,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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:00:47,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:47,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 107 [2022-12-12 12:00:47,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:47,874 INFO L130 PetriNetUnfolder]: 37/215 cut-off events. [2022-12-12 12:00:47,874 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-12 12:00:47,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 215 events. 37/215 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 721 event pairs, 7 based on Foata normal form. 13/213 useless extension candidates. Maximal degree in co-relation 259. Up to 51 conditions per place. [2022-12-12 12:00:47,896 INFO L137 encePairwiseOnDemand]: 102/107 looper letters, 11 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2022-12-12 12:00:47,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 246 flow [2022-12-12 12:00:47,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 12:00:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 12:00:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2022-12-12 12:00:47,913 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9345794392523364 [2022-12-12 12:00:47,931 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 0 predicate places. [2022-12-12 12:00:47,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 104 transitions, 246 flow [2022-12-12 12:00:47,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 104 transitions, 240 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-12 12:00:47,938 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 104 transitions, 240 flow [2022-12-12 12:00:47,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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:00:47,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:47,938 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] [2022-12-12 12:00:47,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 12:00:47,939 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:47,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:47,940 INFO L85 PathProgramCache]: Analyzing trace with hash -996834212, now seen corresponding path program 1 times [2022-12-12 12:00:47,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:47,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704962972] [2022-12-12 12:00:47,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:47,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:48,403 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:00:48,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:48,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704962972] [2022-12-12 12:00:48,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704962972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:48,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:48,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 12:00:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708308693] [2022-12-12 12:00:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:48,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 12:00:48,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:48,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 12:00:48,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 12:00:48,410 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2022-12-12 12:00:48,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 104 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 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:00:48,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:48,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2022-12-12 12:00:48,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:49,622 INFO L130 PetriNetUnfolder]: 1109/2888 cut-off events. [2022-12-12 12:00:49,622 INFO L131 PetriNetUnfolder]: For 663/990 co-relation queries the response was YES. [2022-12-12 12:00:49,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5552 conditions, 2888 events. 1109/2888 cut-off events. For 663/990 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 23568 event pairs, 191 based on Foata normal form. 0/2800 useless extension candidates. Maximal degree in co-relation 5501. Up to 737 conditions per place. [2022-12-12 12:00:49,699 INFO L137 encePairwiseOnDemand]: 98/107 looper letters, 35 selfloop transitions, 6 changer transitions 71/182 dead transitions. [2022-12-12 12:00:49,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 182 transitions, 702 flow [2022-12-12 12:00:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 12:00:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 12:00:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 823 transitions. [2022-12-12 12:00:49,714 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8546209761163032 [2022-12-12 12:00:49,714 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 5 predicate places. [2022-12-12 12:00:49,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 182 transitions, 702 flow [2022-12-12 12:00:49,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 182 transitions, 694 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-12 12:00:49,720 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 182 transitions, 694 flow [2022-12-12 12:00:49,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 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:00:49,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:49,721 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] [2022-12-12 12:00:49,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 12:00:49,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:49,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2057732195, now seen corresponding path program 1 times [2022-12-12 12:00:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:49,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619936192] [2022-12-12 12:00:49,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:49,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:50,065 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:00:50,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:50,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619936192] [2022-12-12 12:00:50,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619936192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:50,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:50,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:00:50,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829379853] [2022-12-12 12:00:50,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:50,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:00:50,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:50,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:00:50,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:00:50,069 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2022-12-12 12:00:50,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 182 transitions, 694 flow. Second operand has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 0 states have call successors, (0), 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:00:50,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:50,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2022-12-12 12:00:50,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:51,148 INFO L130 PetriNetUnfolder]: 1272/3366 cut-off events. [2022-12-12 12:00:51,149 INFO L131 PetriNetUnfolder]: For 980/4226 co-relation queries the response was YES. [2022-12-12 12:00:51,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8475 conditions, 3366 events. 1272/3366 cut-off events. For 980/4226 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 29052 event pairs, 72 based on Foata normal form. 4/3296 useless extension candidates. Maximal degree in co-relation 8422. Up to 871 conditions per place. [2022-12-12 12:00:51,215 INFO L137 encePairwiseOnDemand]: 98/107 looper letters, 45 selfloop transitions, 7 changer transitions 168/290 dead transitions. [2022-12-12 12:00:51,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 290 transitions, 1700 flow [2022-12-12 12:00:51,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 12:00:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 12:00:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1168 transitions. [2022-12-12 12:00:51,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8396836808051761 [2022-12-12 12:00:51,221 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 17 predicate places. [2022-12-12 12:00:51,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 290 transitions, 1700 flow [2022-12-12 12:00:51,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 290 transitions, 1640 flow, removed 30 selfloop flow, removed 0 redundant places. [2022-12-12 12:00:51,251 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 290 transitions, 1640 flow [2022-12-12 12:00:51,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 0 states have call successors, (0), 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:00:51,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:51,252 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] [2022-12-12 12:00:51,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 12:00:51,253 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:51,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash -605088547, now seen corresponding path program 1 times [2022-12-12 12:00:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:51,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216868752] [2022-12-12 12:00:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:51,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:51,817 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:00:51,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:51,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216868752] [2022-12-12 12:00:51,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216868752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:51,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:51,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:00:51,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540917823] [2022-12-12 12:00:51,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:51,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:00:51,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:51,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:00:51,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:00:51,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-12 12:00:51,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 290 transitions, 1640 flow. Second operand has 7 states, 7 states have (on average 82.14285714285714) internal successors, (575), 7 states have internal predecessors, (575), 0 states have call successors, (0), 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:00:51,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:51,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-12 12:00:51,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:53,804 INFO L130 PetriNetUnfolder]: 2436/6380 cut-off events. [2022-12-12 12:00:53,804 INFO L131 PetriNetUnfolder]: For 2747/12531 co-relation queries the response was YES. [2022-12-12 12:00:53,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17410 conditions, 6380 events. 2436/6380 cut-off events. For 2747/12531 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 61057 event pairs, 31 based on Foata normal form. 44/6322 useless extension candidates. Maximal degree in co-relation 17354. Up to 1443 conditions per place. [2022-12-12 12:00:53,836 INFO L137 encePairwiseOnDemand]: 96/107 looper letters, 72 selfloop transitions, 20 changer transitions 429/589 dead transitions. [2022-12-12 12:00:53,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 589 transitions, 4482 flow [2022-12-12 12:00:53,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 12:00:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 12:00:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1520 transitions. [2022-12-12 12:00:53,840 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8356239692138537 [2022-12-12 12:00:53,842 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 33 predicate places. [2022-12-12 12:00:53,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 589 transitions, 4482 flow [2022-12-12 12:00:53,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 589 transitions, 4172 flow, removed 155 selfloop flow, removed 0 redundant places. [2022-12-12 12:00:53,863 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 589 transitions, 4172 flow [2022-12-12 12:00:53,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.14285714285714) internal successors, (575), 7 states have internal predecessors, (575), 0 states have call successors, (0), 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:00:53,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:53,864 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] [2022-12-12 12:00:53,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 12:00:53,865 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:53,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1950012518, now seen corresponding path program 1 times [2022-12-12 12:00:53,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:53,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910605887] [2022-12-12 12:00:53,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:53,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:54,266 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:00:54,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:54,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910605887] [2022-12-12 12:00:54,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910605887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:54,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:54,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 12:00:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33701449] [2022-12-12 12:00:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:54,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 12:00:54,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:54,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 12:00:54,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-12 12:00:54,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-12 12:00:54,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 589 transitions, 4172 flow. Second operand has 8 states, 8 states have (on average 82.0) internal successors, (656), 8 states have internal predecessors, (656), 0 states have call successors, (0), 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:00:54,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:54,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-12 12:00:54,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:57,203 INFO L130 PetriNetUnfolder]: 2871/7979 cut-off events. [2022-12-12 12:00:57,204 INFO L131 PetriNetUnfolder]: For 3095/19799 co-relation queries the response was YES. [2022-12-12 12:00:57,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24727 conditions, 7979 events. 2871/7979 cut-off events. For 3095/19799 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 81243 event pairs, 66 based on Foata normal form. 82/7954 useless extension candidates. Maximal degree in co-relation 24668. Up to 1285 conditions per place. [2022-12-12 12:00:57,268 INFO L137 encePairwiseOnDemand]: 96/107 looper letters, 44 selfloop transitions, 9 changer transitions 604/725 dead transitions. [2022-12-12 12:00:57,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 725 transitions, 6510 flow [2022-12-12 12:00:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 12:00:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 12:00:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1493 transitions. [2022-12-12 12:00:57,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8207806487080813 [2022-12-12 12:00:57,287 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 49 predicate places. [2022-12-12 12:00:57,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 725 transitions, 6510 flow [2022-12-12 12:00:57,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 725 transitions, 5992 flow, removed 259 selfloop flow, removed 0 redundant places. [2022-12-12 12:00:57,375 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 725 transitions, 5992 flow [2022-12-12 12:00:57,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.0) internal successors, (656), 8 states have internal predecessors, (656), 0 states have call successors, (0), 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:00:57,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:57,376 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] [2022-12-12 12:00:57,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 12:00:57,376 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:57,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:57,377 INFO L85 PathProgramCache]: Analyzing trace with hash -272808494, now seen corresponding path program 1 times [2022-12-12 12:00:57,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:57,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714352011] [2022-12-12 12:00:57,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:57,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:57,672 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:00:57,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:57,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714352011] [2022-12-12 12:00:57,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714352011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:57,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:57,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 12:00:57,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405423542] [2022-12-12 12:00:57,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:57,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 12:00:57,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:57,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 12:00:57,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 12:00:57,674 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2022-12-12 12:00:57,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 725 transitions, 5992 flow. Second operand has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 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:00:57,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:57,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2022-12-12 12:00:57,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:01:00,322 INFO L130 PetriNetUnfolder]: 3665/10667 cut-off events. [2022-12-12 12:01:00,322 INFO L131 PetriNetUnfolder]: For 5370/16710 co-relation queries the response was YES. [2022-12-12 12:01:00,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34611 conditions, 10667 events. 3665/10667 cut-off events. For 5370/16710 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 118096 event pairs, 20 based on Foata normal form. 49/10621 useless extension candidates. Maximal degree in co-relation 34552. Up to 3098 conditions per place. [2022-12-12 12:01:00,416 INFO L137 encePairwiseOnDemand]: 100/107 looper letters, 44 selfloop transitions, 5 changer transitions 869/993 dead transitions. [2022-12-12 12:01:00,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 993 transitions, 9990 flow [2022-12-12 12:01:00,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 12:01:00,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 12:01:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 831 transitions. [2022-12-12 12:01:00,418 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8629283489096573 [2022-12-12 12:01:00,419 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 57 predicate places. [2022-12-12 12:01:00,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 993 transitions, 9990 flow [2022-12-12 12:01:00,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 993 transitions, 9848 flow, removed 71 selfloop flow, removed 0 redundant places. [2022-12-12 12:01:00,510 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 993 transitions, 9848 flow [2022-12-12 12:01:00,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 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:01:00,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:01:00,524 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] [2022-12-12 12:01:00,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 12:01:00,524 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:01:00,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:01:00,525 INFO L85 PathProgramCache]: Analyzing trace with hash -791269807, now seen corresponding path program 1 times [2022-12-12 12:01:00,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:01:00,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603635864] [2022-12-12 12:01:00,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:01:00,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:01:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:01:00,894 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:01:00,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:01:00,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603635864] [2022-12-12 12:01:00,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603635864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:01:00,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:01:00,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 12:01:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955710845] [2022-12-12 12:01:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:01:00,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 12:01:00,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:01:00,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 12:01:00,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 12:01:00,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 107 [2022-12-12 12:01:00,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 993 transitions, 9848 flow. Second operand has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 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:01:00,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:01:00,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 107 [2022-12-12 12:01:00,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:01:01,764 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][281], [72#L4true, 14#L763true, 137#true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 160#true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 223#true, 121#true]) [2022-12-12 12:01:01,765 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:01,765 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:01,765 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:01,765 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:01,765 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][251], [72#L4true, 56#L814true, 91#L745true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-12 12:01:01,765 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:01,766 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:01,766 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:01,766 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:01,766 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][252], [72#L4true, 91#L745true, 118#true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-12 12:01:01,766 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:01,766 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:01,766 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:01,766 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:01,871 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][281], [14#L763true, 137#true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 78#L4-1true, 160#true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 223#true, 121#true]) [2022-12-12 12:01:01,871 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:01,872 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:01,872 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:01,872 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:01,872 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][251], [56#L814true, 91#L745true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 78#L4-1true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-12 12:01:01,872 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:01,872 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:01,872 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:01,872 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:01,873 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][252], [91#L745true, 118#true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 78#L4-1true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-12 12:01:01,873 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:01,873 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:01,873 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:01,873 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:02,927 INFO L130 PetriNetUnfolder]: 5563/13154 cut-off events. [2022-12-12 12:01:02,927 INFO L131 PetriNetUnfolder]: For 31577/36547 co-relation queries the response was YES. [2022-12-12 12:01:02,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43834 conditions, 13154 events. 5563/13154 cut-off events. For 31577/36547 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 129588 event pairs, 179 based on Foata normal form. 844/13653 useless extension candidates. Maximal degree in co-relation 43773. Up to 4650 conditions per place. [2022-12-12 12:01:02,986 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 146 selfloop transitions, 13 changer transitions 588/890 dead transitions. [2022-12-12 12:01:02,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 890 transitions, 9448 flow [2022-12-12 12:01:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 12:01:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 12:01:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 921 transitions. [2022-12-12 12:01:02,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8607476635514019 [2022-12-12 12:01:02,993 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 66 predicate places. [2022-12-12 12:01:02,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 890 transitions, 9448 flow [2022-12-12 12:01:03,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 890 transitions, 9284 flow, removed 81 selfloop flow, removed 1 redundant places. [2022-12-12 12:01:03,048 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 890 transitions, 9284 flow [2022-12-12 12:01:03,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 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:01:03,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:01:03,048 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] [2022-12-12 12:01:03,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 12:01:03,051 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:01:03,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:01:03,052 INFO L85 PathProgramCache]: Analyzing trace with hash 737102292, now seen corresponding path program 1 times [2022-12-12 12:01:03,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:01:03,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332100179] [2022-12-12 12:01:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:01:03,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:01:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:01:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:01:03,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:01:03,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332100179] [2022-12-12 12:01:03,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332100179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:01:03,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:01:03,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:01:03,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248528865] [2022-12-12 12:01:03,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:01:03,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:01:03,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:01:03,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:01:03,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:01:03,276 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 107 [2022-12-12 12:01:03,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 890 transitions, 9284 flow. Second operand has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 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:01:03,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:01:03,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 107 [2022-12-12 12:01:03,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:01:03,956 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][239], [72#L4true, 162#(= ~y~0 0), 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 56#L814true, 91#L745true, 118#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, 90#L784true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 223#true, 121#true]) [2022-12-12 12:01:03,956 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-12 12:01:03,956 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:03,956 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:03,956 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:03,957 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][234], [72#L4true, 162#(= ~y~0 0), 14#L763true, 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, 90#L784true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 223#true, 121#true]) [2022-12-12 12:01:03,957 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-12 12:01:03,957 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:03,957 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:03,957 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:04,098 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][237], [72#L4true, 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 91#L745true, 56#L814true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 160#true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 223#true, 121#true]) [2022-12-12 12:01:04,098 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,098 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,098 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,098 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,098 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][233], [72#L4true, 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 91#L745true, 118#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 160#true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 223#true, 121#true]) [2022-12-12 12:01:04,099 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,099 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,099 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,099 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,099 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][236], [72#L4true, 14#L763true, 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 160#true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 223#true, 121#true]) [2022-12-12 12:01:04,099 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,099 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,099 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,100 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,101 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][239], [162#(= ~y~0 0), 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 91#L745true, 56#L814true, 118#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, 90#L784true, 78#L4-1true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 223#true, 121#true]) [2022-12-12 12:01:04,101 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,101 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,101 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,101 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,102 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][234], [162#(= ~y~0 0), 14#L763true, 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, 90#L784true, 78#L4-1true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 223#true, 121#true]) [2022-12-12 12:01:04,102 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,102 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,102 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,102 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:04,103 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][236], [14#L763true, 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 78#L4-1true, 160#true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 223#true, 121#true]) [2022-12-12 12:01:04,103 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:04,103 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:04,103 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:04,103 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:04,236 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][233], [137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 91#L745true, 118#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, P0Thread1of1ForFork2InUse, 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 160#true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 223#true, 121#true]) [2022-12-12 12:01:04,236 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:04,236 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:04,236 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:04,236 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:04,237 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][237], [137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 56#L814true, 91#L745true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 78#L4-1true, 160#true, 250#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 223#true, 121#true]) [2022-12-12 12:01:04,237 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:04,237 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:04,237 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:04,237 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:04,761 INFO L130 PetriNetUnfolder]: 3917/8235 cut-off events. [2022-12-12 12:01:04,761 INFO L131 PetriNetUnfolder]: For 31567/40704 co-relation queries the response was YES. [2022-12-12 12:01:04,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32510 conditions, 8235 events. 3917/8235 cut-off events. For 31567/40704 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 71841 event pairs, 67 based on Foata normal form. 1405/9485 useless extension candidates. Maximal degree in co-relation 32447. Up to 2750 conditions per place. [2022-12-12 12:01:04,796 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 68 selfloop transitions, 13 changer transitions 608/780 dead transitions. [2022-12-12 12:01:04,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 780 transitions, 9036 flow [2022-12-12 12:01:04,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 12:01:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 12:01:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1200 transitions. [2022-12-12 12:01:04,802 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8626887131560029 [2022-12-12 12:01:04,805 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 68 predicate places. [2022-12-12 12:01:04,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 780 transitions, 9036 flow [2022-12-12 12:01:04,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 780 transitions, 7809 flow, removed 522 selfloop flow, removed 14 redundant places. [2022-12-12 12:01:04,980 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 780 transitions, 7809 flow [2022-12-12 12:01:04,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 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:01:04,981 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:01:04,981 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] [2022-12-12 12:01:04,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 12:01:04,981 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:01:04,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:01:04,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2033026587, now seen corresponding path program 1 times [2022-12-12 12:01:04,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:01:04,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045829343] [2022-12-12 12:01:04,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:01:04,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:01:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:01:05,225 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:01:05,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:01:05,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045829343] [2022-12-12 12:01:05,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045829343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:01:05,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:01:05,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 12:01:05,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090099317] [2022-12-12 12:01:05,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:01:05,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 12:01:05,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:01:05,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 12:01:05,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 12:01:05,229 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 107 [2022-12-12 12:01:05,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 780 transitions, 7809 flow. Second operand has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 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:01:05,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:01:05,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 107 [2022-12-12 12:01:05,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:01:05,688 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][186], [162#(= ~y~0 0), 137#true, 56#L814true, 91#L745true, 53#L3true, 118#true, 267#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, 90#L784true, 223#true, 293#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-12 12:01:05,689 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-12 12:01:05,689 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-12 12:01:05,689 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-12 12:01:05,689 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-12 12:01:05,689 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][154], [162#(= ~y~0 0), 14#L763true, 137#true, 53#L3true, 118#true, 267#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, 90#L784true, 223#true, 293#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-12 12:01:05,689 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-12 12:01:05,689 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-12 12:01:05,689 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-12 12:01:05,689 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-12 12:01:05,783 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][181], [14#L763true, 137#true, 53#L3true, 118#true, 267#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 160#true, 223#true, 293#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-12 12:01:05,783 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,783 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,783 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,783 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,784 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][182], [137#true, 91#L745true, 53#L3true, 118#true, 267#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 160#true, 223#true, 293#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-12 12:01:05,784 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,784 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,784 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,784 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,784 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][225], [137#true, 56#L814true, 91#L745true, 53#L3true, 118#true, 267#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 160#true, 223#true, 293#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-12 12:01:05,784 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,784 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,785 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,785 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,785 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][240], [72#L4true, 162#(= ~y~0 0), 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 56#L814true, 91#L745true, 118#true, 295#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, 90#L784true, 223#true]) [2022-12-12 12:01:05,786 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,786 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,786 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,786 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,786 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][234], [72#L4true, 14#L763true, 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 295#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 160#true, 223#true]) [2022-12-12 12:01:05,786 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,786 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,787 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,787 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,787 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][242], [72#L4true, 162#(= ~y~0 0), 14#L763true, 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 295#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, 90#L784true, 223#true]) [2022-12-12 12:01:05,787 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,787 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,787 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,787 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:05,907 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][235], [72#L4true, 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 91#L745true, 118#true, 295#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 160#true, 223#true]) [2022-12-12 12:01:05,907 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,907 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,907 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,907 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,908 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][239], [72#L4true, 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 56#L814true, 91#L745true, 118#true, 295#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 160#true, 223#true]) [2022-12-12 12:01:05,908 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,908 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,908 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,908 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,914 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][240], [162#(= ~y~0 0), 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 56#L814true, 91#L745true, 118#true, 295#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, 90#L784true, 78#L4-1true, 223#true]) [2022-12-12 12:01:05,914 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,914 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,914 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,914 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,914 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][234], [14#L763true, 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 295#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 78#L4-1true, 160#true, 223#true]) [2022-12-12 12:01:05,914 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:05,914 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:05,914 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:05,914 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:05,915 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][242], [162#(= ~y~0 0), 14#L763true, 137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 295#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, 90#L784true, 78#L4-1true, 223#true]) [2022-12-12 12:01:05,915 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,915 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,915 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:05,915 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:06,044 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][235], [137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 91#L745true, 118#true, 295#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 78#L4-1true, 160#true, 223#true]) [2022-12-12 12:01:06,044 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:06,045 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:06,045 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:06,045 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:06,046 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][239], [137#true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 91#L745true, 56#L814true, 118#true, 295#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 78#L4-1true, 160#true, 223#true]) [2022-12-12 12:01:06,046 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:06,046 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:06,046 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:06,046 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:06,464 INFO L130 PetriNetUnfolder]: 3725/7337 cut-off events. [2022-12-12 12:01:06,465 INFO L131 PetriNetUnfolder]: For 28617/36894 co-relation queries the response was YES. [2022-12-12 12:01:06,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32361 conditions, 7337 events. 3725/7337 cut-off events. For 28617/36894 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 63211 event pairs, 67 based on Foata normal form. 1441/8659 useless extension candidates. Maximal degree in co-relation 32298. Up to 1902 conditions per place. [2022-12-12 12:01:06,487 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 45 selfloop transitions, 16 changer transitions 566/704 dead transitions. [2022-12-12 12:01:06,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 704 transitions, 8370 flow [2022-12-12 12:01:06,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 12:01:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 12:01:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1443 transitions. [2022-12-12 12:01:06,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.842873831775701 [2022-12-12 12:01:06,492 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 54 predicate places. [2022-12-12 12:01:06,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 704 transitions, 8370 flow [2022-12-12 12:01:06,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 704 transitions, 7163 flow, removed 570 selfloop flow, removed 11 redundant places. [2022-12-12 12:01:06,513 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 704 transitions, 7163 flow [2022-12-12 12:01:06,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 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:01:06,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:01:06,514 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] [2022-12-12 12:01:06,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 12:01:06,514 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:01:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:01:06,515 INFO L85 PathProgramCache]: Analyzing trace with hash -867286156, now seen corresponding path program 1 times [2022-12-12 12:01:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:01:06,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075391206] [2022-12-12 12:01:06,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:01:06,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:01:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:01:07,369 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:01:07,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:01:07,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075391206] [2022-12-12 12:01:07,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075391206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:01:07,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:01:07,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-12 12:01:07,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561332719] [2022-12-12 12:01:07,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:01:07,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 12:01:07,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:01:07,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 12:01:07,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-12 12:01:07,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 107 [2022-12-12 12:01:07,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 704 transitions, 7163 flow. Second operand has 11 states, 11 states have (on average 76.54545454545455) internal successors, (842), 11 states have internal predecessors, (842), 0 states have call successors, (0), 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:01:07,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:01:07,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 107 [2022-12-12 12:01:07,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:01:08,478 INFO L130 PetriNetUnfolder]: 3967/8356 cut-off events. [2022-12-12 12:01:08,479 INFO L131 PetriNetUnfolder]: For 33657/48769 co-relation queries the response was YES. [2022-12-12 12:01:08,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32353 conditions, 8356 events. 3967/8356 cut-off events. For 33657/48769 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 77280 event pairs, 73 based on Foata normal form. 1930/10192 useless extension candidates. Maximal degree in co-relation 32280. Up to 1452 conditions per place. [2022-12-12 12:01:08,513 INFO L137 encePairwiseOnDemand]: 93/107 looper letters, 33 selfloop transitions, 20 changer transitions 747/873 dead transitions. [2022-12-12 12:01:08,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 873 transitions, 10474 flow [2022-12-12 12:01:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 12:01:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 12:01:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1029 transitions. [2022-12-12 12:01:08,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7397555715312725 [2022-12-12 12:01:08,517 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 55 predicate places. [2022-12-12 12:01:08,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 873 transitions, 10474 flow [2022-12-12 12:01:08,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 873 transitions, 10038 flow, removed 181 selfloop flow, removed 4 redundant places. [2022-12-12 12:01:08,543 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 873 transitions, 10038 flow [2022-12-12 12:01:08,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 76.54545454545455) internal successors, (842), 11 states have internal predecessors, (842), 0 states have call successors, (0), 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:01:08,543 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:01:08,543 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] [2022-12-12 12:01:08,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 12:01:08,544 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:01:08,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:01:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash 457590362, now seen corresponding path program 2 times [2022-12-12 12:01:08,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:01:08,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517685325] [2022-12-12 12:01:08,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:01:08,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:01:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:01:08,791 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:01:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:01:08,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517685325] [2022-12-12 12:01:08,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517685325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:01:08,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:01:08,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:01:08,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646487490] [2022-12-12 12:01:08,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:01:08,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:01:08,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:01:08,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:01:08,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:01:08,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2022-12-12 12:01:08,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 873 transitions, 10038 flow. Second operand has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 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:01:08,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:01:08,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2022-12-12 12:01:08,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:01:09,985 INFO L130 PetriNetUnfolder]: 5154/11158 cut-off events. [2022-12-12 12:01:09,986 INFO L131 PetriNetUnfolder]: For 47494/61514 co-relation queries the response was YES. [2022-12-12 12:01:10,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44310 conditions, 11158 events. 5154/11158 cut-off events. For 47494/61514 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 110049 event pairs, 91 based on Foata normal form. 2570/13623 useless extension candidates. Maximal degree in co-relation 44245. Up to 2024 conditions per place. [2022-12-12 12:01:10,024 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 26 selfloop transitions, 4 changer transitions 978/1084 dead transitions. [2022-12-12 12:01:10,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 1084 transitions, 14649 flow [2022-12-12 12:01:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 12:01:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 12:01:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 613 transitions. [2022-12-12 12:01:10,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8184245660881175 [2022-12-12 12:01:10,027 INFO L295 CegarLoopForPetriNet]: 112 programPoint places, 57 predicate places. [2022-12-12 12:01:10,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 1084 transitions, 14649 flow [2022-12-12 12:01:10,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 1084 transitions, 14010 flow, removed 261 selfloop flow, removed 1 redundant places. [2022-12-12 12:01:10,051 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 1084 transitions, 14010 flow [2022-12-12 12:01:10,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 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:01:10,052 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:01:10,052 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] [2022-12-12 12:01:10,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 12:01:10,052 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:01:10,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:01:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1348260068, now seen corresponding path program 3 times [2022-12-12 12:01:10,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:01:10,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296332599] [2022-12-12 12:01:10,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:01:10,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:01:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 12:01:10,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 12:01:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 12:01:10,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 12:01:10,163 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 12:01:10,164 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 12:01:10,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 12:01:10,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 12:01:10,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 12:01:10,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 12:01:10,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 12:01:10,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 12:01:10,167 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:01:10,173 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 12:01:10,173 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 12:01:10,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 12:01:10 BasicIcfg [2022-12-12 12:01:10,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 12:01:10,291 INFO L158 Benchmark]: Toolchain (without parser) took 25733.09ms. Allocated memory was 181.4MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 156.5MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 451.3MB. Max. memory is 8.0GB. [2022-12-12 12:01:10,291 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 12:01:10,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.72ms. Allocated memory is still 181.4MB. Free memory was 156.0MB in the beginning and 130.3MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 12:01:10,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.70ms. Allocated memory is still 181.4MB. Free memory was 130.3MB in the beginning and 127.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 12:01:10,293 INFO L158 Benchmark]: Boogie Preprocessor took 62.09ms. Allocated memory is still 181.4MB. Free memory was 127.6MB in the beginning and 125.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 12:01:10,293 INFO L158 Benchmark]: RCFGBuilder took 937.44ms. Allocated memory is still 181.4MB. Free memory was 125.5MB in the beginning and 94.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-12 12:01:10,293 INFO L158 Benchmark]: TraceAbstraction took 24058.35ms. Allocated memory was 181.4MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 93.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 388.4MB. Max. memory is 8.0GB. [2022-12-12 12:01:10,295 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.14ms. Allocated memory is still 181.4MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 596.72ms. Allocated memory is still 181.4MB. Free memory was 156.0MB in the beginning and 130.3MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.70ms. Allocated memory is still 181.4MB. Free memory was 130.3MB in the beginning and 127.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.09ms. Allocated memory is still 181.4MB. Free memory was 127.6MB in the beginning and 125.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 937.44ms. Allocated memory is still 181.4MB. Free memory was 125.5MB in the beginning and 94.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 24058.35ms. Allocated memory was 181.4MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 93.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 388.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2073; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2073, ((void *)0), P0, ((void *)0))=-2, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2074; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2074, ((void *)0), P1, ((void *)0))=-1, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L835] 0 pthread_t t2075; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2075, ((void *)0), P2, ((void *)0))=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 836]: 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: 832]: 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 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.5s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 929 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 929 mSDsluCounter, 664 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 527 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1381 IncrementalHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 137 mSDtfsCounter, 1381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14010occurred in iteration=11, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 4717 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 890 NumberOfCodeBlocks, 890 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 796 ConstructedInterpolants, 0 QuantifiedInterpolants, 2999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 12:01:10,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...