/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:23:53,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:23:53,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:23:53,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:23:53,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:23:53,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:23:53,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:23:53,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:23:53,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:23:53,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:23:53,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:23:53,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:23:53,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:23:53,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:23:53,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:23:53,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:23:53,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:23:53,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:23:53,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:23:53,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:23:53,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:23:53,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:23:53,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:23:53,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:23:53,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:23:53,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:23:53,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:23:53,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:23:53,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:23:53,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:23:53,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:23:53,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:23:53,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:23:53,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:23:53,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:23:53,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:23:53,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:23:53,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:23:53,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:23:53,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:23:53,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:23:53,951 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-SemanticLbe.epf [2022-12-05 20:23:53,974 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:23:53,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:23:53,975 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:23:53,975 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:23:53,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:23:53,976 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:23:53,976 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:23:53,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:23:53,976 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:23:53,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:23:53,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:23:53,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:23:53,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:23:53,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:23:53,977 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:23:53,978 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:23:53,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:23:53,978 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:23:53,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:23:53,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:23:53,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:23:53,978 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:23:53,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:23:53,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:23:53,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:23:53,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:23:53,979 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:23:53,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:23:53,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:23:53,979 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:23:53,979 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 [2022-12-05 20:23:54,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:23:54,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:23:54,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:23:54,290 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:23:54,291 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:23:54,292 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 20:23:55,468 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:23:55,696 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:23:55,697 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 20:23:55,707 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad6ca336/bbaacbd69649422d88cba452db5b93c9/FLAG7c82965a8 [2022-12-05 20:23:55,719 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad6ca336/bbaacbd69649422d88cba452db5b93c9 [2022-12-05 20:23:55,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:23:55,721 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:23:55,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:23:55,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:23:55,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:23:55,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:23:55" (1/1) ... [2022-12-05 20:23:55,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3416555e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:55, skipping insertion in model container [2022-12-05 20:23:55,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:23:55" (1/1) ... [2022-12-05 20:23:55,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:23:55,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:23:55,907 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 20:23:56,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:23:56,112 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:23:56,120 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 20:23:56,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:56,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:56,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:23:56,204 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:23:56,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:56 WrapperNode [2022-12-05 20:23:56,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:23:56,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:23:56,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:23:56,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:23:56,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:56" (1/1) ... [2022-12-05 20:23:56,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:56" (1/1) ... [2022-12-05 20:23:56,263 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-12-05 20:23:56,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:23:56,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:23:56,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:23:56,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:23:56,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:56" (1/1) ... [2022-12-05 20:23:56,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:56" (1/1) ... [2022-12-05 20:23:56,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:56" (1/1) ... [2022-12-05 20:23:56,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:56" (1/1) ... [2022-12-05 20:23:56,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:56" (1/1) ... [2022-12-05 20:23:56,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:56" (1/1) ... [2022-12-05 20:23:56,293 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:56" (1/1) ... [2022-12-05 20:23:56,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:56" (1/1) ... [2022-12-05 20:23:56,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:23:56,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:23:56,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:23:56,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:23:56,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:56" (1/1) ... [2022-12-05 20:23:56,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:23:56,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:23:56,331 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-05 20:23:56,347 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-05 20:23:56,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:23:56,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:23:56,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:23:56,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:23:56,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:23:56,364 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:23:56,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:23:56,364 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:23:56,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:23:56,364 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:23:56,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:23:56,364 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 20:23:56,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 20:23:56,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:23:56,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:23:56,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:23:56,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:23:56,366 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:23:56,470 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:23:56,471 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:23:56,668 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:23:56,781 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:23:56,781 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:23:56,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:23:56 BoogieIcfgContainer [2022-12-05 20:23:56,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:23:56,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:23:56,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:23:56,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:23:56,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:23:55" (1/3) ... [2022-12-05 20:23:56,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a03a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:23:56, skipping insertion in model container [2022-12-05 20:23:56,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:56" (2/3) ... [2022-12-05 20:23:56,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a03a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:23:56, skipping insertion in model container [2022-12-05 20:23:56,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:23:56" (3/3) ... [2022-12-05 20:23:56,794 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 20:23:56,808 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:23:56,808 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:23:56,808 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:23:56,866 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:23:56,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-05 20:23:56,934 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-05 20:23:56,934 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:56,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 20:23:56,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-05 20:23:56,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-05 20:23:56,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:23:56,961 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-05 20:23:56,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-05 20:23:56,990 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-05 20:23:56,990 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:56,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 20:23:56,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-05 20:23:56,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 2936 [2022-12-05 20:24:02,037 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-05 20:24:02,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:24:02,057 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;@28af761c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:24:02,057 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 20:24:02,070 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-05 20:24:02,070 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:24:02,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:02,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:02,071 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:02,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:02,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1514565341, now seen corresponding path program 1 times [2022-12-05 20:24:02,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:02,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666689251] [2022-12-05 20:24:02,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:02,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:02,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-05 20:24:02,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:02,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666689251] [2022-12-05 20:24:02,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666689251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:02,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:02,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:24:02,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870946890] [2022-12-05 20:24:02,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:02,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:24:02,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:02,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:24:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:24:02,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2022-12-05 20:24:02,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-05 20:24:02,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:02,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2022-12-05 20:24:02,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:02,843 INFO L130 PetriNetUnfolder]: 2891/4513 cut-off events. [2022-12-05 20:24:02,843 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-05 20:24:02,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8613 conditions, 4513 events. 2891/4513 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 26826 event pairs, 668 based on Foata normal form. 0/4212 useless extension candidates. Maximal degree in co-relation 8601. Up to 2980 conditions per place. [2022-12-05 20:24:02,868 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 31 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2022-12-05 20:24:02,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 170 flow [2022-12-05 20:24:02,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:24:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:24:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-05 20:24:02,875 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.59375 [2022-12-05 20:24:02,876 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 57 transitions. [2022-12-05 20:24:02,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 170 flow [2022-12-05 20:24:02,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 20:24:02,881 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2022-12-05 20:24:02,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-05 20:24:02,886 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2022-12-05 20:24:02,886 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2022-12-05 20:24:02,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-05 20:24:02,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:02,886 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:02,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:24:02,887 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:02,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:02,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1788127337, now seen corresponding path program 1 times [2022-12-05 20:24:02,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:02,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778852636] [2022-12-05 20:24:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:03,235 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-05 20:24:03,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:03,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778852636] [2022-12-05 20:24:03,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778852636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:03,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:03,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:24:03,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404383496] [2022-12-05 20:24:03,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:03,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:24:03,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:03,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:24:03,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:24:03,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-05 20:24:03,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-05 20:24:03,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:03,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-05 20:24:03,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:04,426 INFO L130 PetriNetUnfolder]: 11263/15464 cut-off events. [2022-12-05 20:24:04,426 INFO L131 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2022-12-05 20:24:04,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31454 conditions, 15464 events. 11263/15464 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 77693 event pairs, 2087 based on Foata normal form. 720/16184 useless extension candidates. Maximal degree in co-relation 31444. Up to 7121 conditions per place. [2022-12-05 20:24:04,485 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 45 selfloop transitions, 10 changer transitions 40/95 dead transitions. [2022-12-05 20:24:04,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 95 transitions, 394 flow [2022-12-05 20:24:04,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:24:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:24:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2022-12-05 20:24:04,487 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-05 20:24:04,487 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 7 states and 98 transitions. [2022-12-05 20:24:04,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 95 transitions, 394 flow [2022-12-05 20:24:04,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 95 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:04,493 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 158 flow [2022-12-05 20:24:04,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=158, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2022-12-05 20:24:04,493 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2022-12-05 20:24:04,494 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 158 flow [2022-12-05 20:24:04,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-05 20:24:04,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:04,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:04,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:24:04,494 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:04,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:04,494 INFO L85 PathProgramCache]: Analyzing trace with hash 412933729, now seen corresponding path program 1 times [2022-12-05 20:24:04,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:04,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370388653] [2022-12-05 20:24:04,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:04,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:05,092 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-05 20:24:05,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:05,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370388653] [2022-12-05 20:24:05,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370388653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:05,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:05,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:24:05,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128708390] [2022-12-05 20:24:05,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:05,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:24:05,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:05,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:24:05,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:24:05,103 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-05 20:24:05,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 158 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-05 20:24:05,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:05,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-05 20:24:05,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:06,416 INFO L130 PetriNetUnfolder]: 12702/17509 cut-off events. [2022-12-05 20:24:06,417 INFO L131 PetriNetUnfolder]: For 20120/20120 co-relation queries the response was YES. [2022-12-05 20:24:06,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54258 conditions, 17509 events. 12702/17509 cut-off events. For 20120/20120 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 90802 event pairs, 2582 based on Foata normal form. 718/18227 useless extension candidates. Maximal degree in co-relation 54242. Up to 13009 conditions per place. [2022-12-05 20:24:06,491 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 67 selfloop transitions, 21 changer transitions 48/136 dead transitions. [2022-12-05 20:24:06,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 136 transitions, 892 flow [2022-12-05 20:24:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:24:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:24:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2022-12-05 20:24:06,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.421875 [2022-12-05 20:24:06,495 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 158 flow. Second operand 8 states and 108 transitions. [2022-12-05 20:24:06,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 136 transitions, 892 flow [2022-12-05 20:24:06,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 136 transitions, 886 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:06,525 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 397 flow [2022-12-05 20:24:06,525 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=397, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2022-12-05 20:24:06,526 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2022-12-05 20:24:06,526 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 397 flow [2022-12-05 20:24:06,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-05 20:24:06,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:06,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:06,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:24:06,526 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:06,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:06,527 INFO L85 PathProgramCache]: Analyzing trace with hash -370286658, now seen corresponding path program 1 times [2022-12-05 20:24:06,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:06,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73255148] [2022-12-05 20:24:06,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:06,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:06,690 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-05 20:24:06,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:06,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73255148] [2022-12-05 20:24:06,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73255148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:06,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:06,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:24:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153847320] [2022-12-05 20:24:06,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:06,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:24:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:06,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:24:06,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:24:06,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-05 20:24:06,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 397 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-05 20:24:06,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:06,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-05 20:24:06,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:08,008 INFO L130 PetriNetUnfolder]: 9498/13691 cut-off events. [2022-12-05 20:24:08,035 INFO L131 PetriNetUnfolder]: For 45538/45811 co-relation queries the response was YES. [2022-12-05 20:24:08,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54296 conditions, 13691 events. 9498/13691 cut-off events. For 45538/45811 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 79035 event pairs, 2481 based on Foata normal form. 455/13609 useless extension candidates. Maximal degree in co-relation 54274. Up to 10176 conditions per place. [2022-12-05 20:24:08,156 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 62 selfloop transitions, 7 changer transitions 25/108 dead transitions. [2022-12-05 20:24:08,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 108 transitions, 929 flow [2022-12-05 20:24:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:24:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:24:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-05 20:24:08,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48125 [2022-12-05 20:24:08,158 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 397 flow. Second operand 5 states and 77 transitions. [2022-12-05 20:24:08,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 108 transitions, 929 flow [2022-12-05 20:24:08,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 108 transitions, 905 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-05 20:24:08,177 INFO L231 Difference]: Finished difference. Result has 59 places, 61 transitions, 474 flow [2022-12-05 20:24:08,177 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=474, PETRI_PLACES=59, PETRI_TRANSITIONS=61} [2022-12-05 20:24:08,178 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2022-12-05 20:24:08,179 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 474 flow [2022-12-05 20:24:08,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-05 20:24:08,179 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:08,179 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:08,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:24:08,179 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:08,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:08,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1295512080, now seen corresponding path program 1 times [2022-12-05 20:24:08,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:08,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798398773] [2022-12-05 20:24:08,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:08,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:08,315 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-05 20:24:08,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:08,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798398773] [2022-12-05 20:24:08,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798398773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:08,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:08,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:24:08,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114456683] [2022-12-05 20:24:08,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:08,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:24:08,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:08,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:24:08,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:24:08,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-05 20:24:08,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 474 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-05 20:24:08,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:08,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-05 20:24:08,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:09,022 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L784-->L791: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_90 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd3~0_19 (ite .cse1 0 v_~z$r_buff0_thd3~0_20)) (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_36 (ite .cse2 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_19 256) 0)))) 0 v_~z$r_buff1_thd3~0_18) v_~z$r_buff1_thd3~0_17)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][36], [111#P1EXITtrue, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 90#L791true, Black: 156#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 151#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 75#$Ultimate##0true, Black: 152#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(<= ~__unbuffered_p3_EAX~0 0), 193#(= ~y~0 1), 148#true, Black: 171#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 175#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 182#true, Black: 166#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 173#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 85#L862true, 12#L820true, Black: 185#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 187#(and (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(= ~y~0 0), 163#true]) [2022-12-05 20:24:09,022 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-05 20:24:09,022 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-05 20:24:09,022 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-05 20:24:09,022 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-05 20:24:09,026 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([483] L862-->L18: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd0~0_196 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd0~0_197 256) 0))) (let ((.cse8 (not .cse6)) (.cse9 (and .cse6 (= (mod v_~z$w_buff1_used~0_288 256) 0))) (.cse5 (and .cse10 .cse6)) (.cse12 (= (mod v_~z$w_buff0_used~0_326 256) 0))) (let ((.cse2 (or .cse9 .cse5 .cse12)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~z~0_250 (ite .cse3 v_~z$w_buff0~0_213 v_~z$w_buff1~0_171))) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse4 (= (mod v_~z$w_buff0_used~0_325 256) 0)) (.cse7 (= (mod v_~z$w_buff1_used~0_287 256) 0))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| (mod v_~main$tmp_guard1~0_46 256)) (= v_~z~0_249 (ite .cse0 v_~z$mem_tmp~0_58 .cse1)) (= (ite .cse0 v_~z$w_buff0_used~0_326 (ite .cse2 v_~z$w_buff0_used~0_326 (ite .cse3 0 v_~z$w_buff0_used~0_326))) v_~z$w_buff0_used~0_325) (= v_~weak$$choice0~0_43 |v_ULTIMATE.start_main_#t~nondet11#1_79|) (= v_~z$r_buff0_thd0~0_196 (ite .cse0 v_~z$r_buff0_thd0~0_197 (ite (or .cse4 .cse5 (and .cse6 .cse7)) v_~z$r_buff0_thd0~0_197 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd0~0_197)))) (= v_~z$w_buff0~0_213 v_~z$w_buff0~0_212) (= v_~z$w_buff1_used~0_287 (ite .cse0 v_~z$w_buff1_used~0_288 (ite (or .cse9 .cse4 .cse5) v_~z$w_buff1_used~0_288 0))) (= v_~z$mem_tmp~0_58 v_~z~0_250) (= v_~main$tmp_guard1~0_46 (ite (= (ite (not (and (= .cse1 2) (= 0 v_~__unbuffered_p3_EBX~0_42) (= v_~y~0_53 2) (= v_~__unbuffered_p3_EAX~0_40 1) (= v_~x~0_49 2))) 1 0) 0) 0 1)) (= v_~z$w_buff1~0_171 v_~z$w_buff1~0_170) (= v_~z$flush_delayed~0_69 0) (= v_~z$r_buff1_thd0~0_195 (ite .cse0 v_~z$r_buff1_thd0~0_196 (ite (let ((.cse11 (= (mod v_~z$r_buff0_thd0~0_196 256) 0))) (or (and .cse10 .cse11) .cse4 (and .cse11 .cse7))) v_~z$r_buff1_thd0~0_196 0))) (= v_~weak$$choice2~0_66 |v_ULTIMATE.start_main_#t~nondet12#1_79|)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_326, ~z$w_buff0~0=v_~z$w_buff0~0_213, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_288, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_42, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_79|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_79|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_196, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_40, ~z~0=v_~z~0_250, ~y~0=v_~y~0_53, ~x~0=v_~x~0_49} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_58, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_325, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_287, ~z$w_buff1~0=v_~z$w_buff1~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z$flush_delayed~0=v_~z$flush_delayed~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_42, ~weak$$choice0~0=v_~weak$$choice0~0_43, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_196, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_40, ~z~0=v_~z~0_249, ~y~0=v_~y~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_66, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[~z$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z~0, ~weak$$choice2~0][79], [111#P1EXITtrue, 44#L784true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 103#L18true, 196#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), Black: 156#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 75#$Ultimate##0true, Black: 151#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 152#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(<= ~__unbuffered_p3_EAX~0 0), 148#true, Black: 171#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 175#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 182#true, Black: 166#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 173#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 12#L820true, Black: 185#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 187#(and (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 163#true, Black: 184#(= ~y~0 0)]) [2022-12-05 20:24:09,026 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-05 20:24:09,027 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-05 20:24:09,027 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-05 20:24:09,027 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-05 20:24:09,190 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([483] L862-->L18: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd0~0_196 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd0~0_197 256) 0))) (let ((.cse8 (not .cse6)) (.cse9 (and .cse6 (= (mod v_~z$w_buff1_used~0_288 256) 0))) (.cse5 (and .cse10 .cse6)) (.cse12 (= (mod v_~z$w_buff0_used~0_326 256) 0))) (let ((.cse2 (or .cse9 .cse5 .cse12)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~z~0_250 (ite .cse3 v_~z$w_buff0~0_213 v_~z$w_buff1~0_171))) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse4 (= (mod v_~z$w_buff0_used~0_325 256) 0)) (.cse7 (= (mod v_~z$w_buff1_used~0_287 256) 0))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| (mod v_~main$tmp_guard1~0_46 256)) (= v_~z~0_249 (ite .cse0 v_~z$mem_tmp~0_58 .cse1)) (= (ite .cse0 v_~z$w_buff0_used~0_326 (ite .cse2 v_~z$w_buff0_used~0_326 (ite .cse3 0 v_~z$w_buff0_used~0_326))) v_~z$w_buff0_used~0_325) (= v_~weak$$choice0~0_43 |v_ULTIMATE.start_main_#t~nondet11#1_79|) (= v_~z$r_buff0_thd0~0_196 (ite .cse0 v_~z$r_buff0_thd0~0_197 (ite (or .cse4 .cse5 (and .cse6 .cse7)) v_~z$r_buff0_thd0~0_197 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd0~0_197)))) (= v_~z$w_buff0~0_213 v_~z$w_buff0~0_212) (= v_~z$w_buff1_used~0_287 (ite .cse0 v_~z$w_buff1_used~0_288 (ite (or .cse9 .cse4 .cse5) v_~z$w_buff1_used~0_288 0))) (= v_~z$mem_tmp~0_58 v_~z~0_250) (= v_~main$tmp_guard1~0_46 (ite (= (ite (not (and (= .cse1 2) (= 0 v_~__unbuffered_p3_EBX~0_42) (= v_~y~0_53 2) (= v_~__unbuffered_p3_EAX~0_40 1) (= v_~x~0_49 2))) 1 0) 0) 0 1)) (= v_~z$w_buff1~0_171 v_~z$w_buff1~0_170) (= v_~z$flush_delayed~0_69 0) (= v_~z$r_buff1_thd0~0_195 (ite .cse0 v_~z$r_buff1_thd0~0_196 (ite (let ((.cse11 (= (mod v_~z$r_buff0_thd0~0_196 256) 0))) (or (and .cse10 .cse11) .cse4 (and .cse11 .cse7))) v_~z$r_buff1_thd0~0_196 0))) (= v_~weak$$choice2~0_66 |v_ULTIMATE.start_main_#t~nondet12#1_79|)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_326, ~z$w_buff0~0=v_~z$w_buff0~0_213, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_288, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_42, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_79|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_79|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_196, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_40, ~z~0=v_~z~0_250, ~y~0=v_~y~0_53, ~x~0=v_~x~0_49} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_58, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_325, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_287, ~z$w_buff1~0=v_~z$w_buff1~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z$flush_delayed~0=v_~z$flush_delayed~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_42, ~weak$$choice0~0=v_~weak$$choice0~0_43, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_196, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_40, ~z~0=v_~z~0_249, ~y~0=v_~y~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_66, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[~z$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z~0, ~weak$$choice2~0][79], [111#P1EXITtrue, 44#L784true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 84#L754true, P3Thread1of1ForFork2InUse, 118#L817true, P2Thread1of1ForFork0InUse, 103#L18true, 196#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), Black: 156#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 151#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 152#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(<= ~__unbuffered_p3_EAX~0 0), 148#true, Black: 171#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 182#true, Black: 175#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 166#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 173#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 185#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 187#(and (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(= ~y~0 0), 163#true]) [2022-12-05 20:24:09,191 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-05 20:24:09,191 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:24:09,191 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:24:09,191 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:24:09,228 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L784-->L791: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_90 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd3~0_19 (ite .cse1 0 v_~z$r_buff0_thd3~0_20)) (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_36 (ite .cse2 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_19 256) 0)))) 0 v_~z$r_buff1_thd3~0_18) v_~z$r_buff1_thd3~0_17)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][36], [111#P1EXITtrue, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 90#L791true, Black: 156#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 151#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 152#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(<= ~__unbuffered_p3_EAX~0 0), 193#(= ~y~0 1), 148#true, Black: 171#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 182#true, Black: 175#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 166#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 74#L751true, Black: 173#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 85#L862true, 12#L820true, Black: 185#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 187#(and (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 163#true, Black: 184#(= ~y~0 0)]) [2022-12-05 20:24:09,229 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-05 20:24:09,229 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:24:09,229 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:24:09,229 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:24:09,232 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([483] L862-->L18: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd0~0_196 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd0~0_197 256) 0))) (let ((.cse8 (not .cse6)) (.cse9 (and .cse6 (= (mod v_~z$w_buff1_used~0_288 256) 0))) (.cse5 (and .cse10 .cse6)) (.cse12 (= (mod v_~z$w_buff0_used~0_326 256) 0))) (let ((.cse2 (or .cse9 .cse5 .cse12)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~z~0_250 (ite .cse3 v_~z$w_buff0~0_213 v_~z$w_buff1~0_171))) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse4 (= (mod v_~z$w_buff0_used~0_325 256) 0)) (.cse7 (= (mod v_~z$w_buff1_used~0_287 256) 0))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| (mod v_~main$tmp_guard1~0_46 256)) (= v_~z~0_249 (ite .cse0 v_~z$mem_tmp~0_58 .cse1)) (= (ite .cse0 v_~z$w_buff0_used~0_326 (ite .cse2 v_~z$w_buff0_used~0_326 (ite .cse3 0 v_~z$w_buff0_used~0_326))) v_~z$w_buff0_used~0_325) (= v_~weak$$choice0~0_43 |v_ULTIMATE.start_main_#t~nondet11#1_79|) (= v_~z$r_buff0_thd0~0_196 (ite .cse0 v_~z$r_buff0_thd0~0_197 (ite (or .cse4 .cse5 (and .cse6 .cse7)) v_~z$r_buff0_thd0~0_197 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd0~0_197)))) (= v_~z$w_buff0~0_213 v_~z$w_buff0~0_212) (= v_~z$w_buff1_used~0_287 (ite .cse0 v_~z$w_buff1_used~0_288 (ite (or .cse9 .cse4 .cse5) v_~z$w_buff1_used~0_288 0))) (= v_~z$mem_tmp~0_58 v_~z~0_250) (= v_~main$tmp_guard1~0_46 (ite (= (ite (not (and (= .cse1 2) (= 0 v_~__unbuffered_p3_EBX~0_42) (= v_~y~0_53 2) (= v_~__unbuffered_p3_EAX~0_40 1) (= v_~x~0_49 2))) 1 0) 0) 0 1)) (= v_~z$w_buff1~0_171 v_~z$w_buff1~0_170) (= v_~z$flush_delayed~0_69 0) (= v_~z$r_buff1_thd0~0_195 (ite .cse0 v_~z$r_buff1_thd0~0_196 (ite (let ((.cse11 (= (mod v_~z$r_buff0_thd0~0_196 256) 0))) (or (and .cse10 .cse11) .cse4 (and .cse11 .cse7))) v_~z$r_buff1_thd0~0_196 0))) (= v_~weak$$choice2~0_66 |v_ULTIMATE.start_main_#t~nondet12#1_79|)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_326, ~z$w_buff0~0=v_~z$w_buff0~0_213, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_288, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_42, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_79|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_79|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_196, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_40, ~z~0=v_~z~0_250, ~y~0=v_~y~0_53, ~x~0=v_~x~0_49} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_58, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_325, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_287, ~z$w_buff1~0=v_~z$w_buff1~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z$flush_delayed~0=v_~z$flush_delayed~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_42, ~weak$$choice0~0=v_~weak$$choice0~0_43, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_196, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_40, ~z~0=v_~z~0_249, ~y~0=v_~y~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_66, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[~z$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z~0, ~weak$$choice2~0][79], [111#P1EXITtrue, 44#L784true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 103#L18true, 196#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), Black: 156#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 151#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 152#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(<= ~__unbuffered_p3_EAX~0 0), 148#true, Black: 171#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 182#true, Black: 175#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 166#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 74#L751true, Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 173#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 12#L820true, Black: 185#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 187#(and (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(= ~y~0 0), 163#true]) [2022-12-05 20:24:09,232 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-05 20:24:09,232 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:24:09,232 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:24:09,233 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:24:09,313 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([483] L862-->L18: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd0~0_196 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd0~0_197 256) 0))) (let ((.cse8 (not .cse6)) (.cse9 (and .cse6 (= (mod v_~z$w_buff1_used~0_288 256) 0))) (.cse5 (and .cse10 .cse6)) (.cse12 (= (mod v_~z$w_buff0_used~0_326 256) 0))) (let ((.cse2 (or .cse9 .cse5 .cse12)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~z~0_250 (ite .cse3 v_~z$w_buff0~0_213 v_~z$w_buff1~0_171))) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse4 (= (mod v_~z$w_buff0_used~0_325 256) 0)) (.cse7 (= (mod v_~z$w_buff1_used~0_287 256) 0))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| (mod v_~main$tmp_guard1~0_46 256)) (= v_~z~0_249 (ite .cse0 v_~z$mem_tmp~0_58 .cse1)) (= (ite .cse0 v_~z$w_buff0_used~0_326 (ite .cse2 v_~z$w_buff0_used~0_326 (ite .cse3 0 v_~z$w_buff0_used~0_326))) v_~z$w_buff0_used~0_325) (= v_~weak$$choice0~0_43 |v_ULTIMATE.start_main_#t~nondet11#1_79|) (= v_~z$r_buff0_thd0~0_196 (ite .cse0 v_~z$r_buff0_thd0~0_197 (ite (or .cse4 .cse5 (and .cse6 .cse7)) v_~z$r_buff0_thd0~0_197 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd0~0_197)))) (= v_~z$w_buff0~0_213 v_~z$w_buff0~0_212) (= v_~z$w_buff1_used~0_287 (ite .cse0 v_~z$w_buff1_used~0_288 (ite (or .cse9 .cse4 .cse5) v_~z$w_buff1_used~0_288 0))) (= v_~z$mem_tmp~0_58 v_~z~0_250) (= v_~main$tmp_guard1~0_46 (ite (= (ite (not (and (= .cse1 2) (= 0 v_~__unbuffered_p3_EBX~0_42) (= v_~y~0_53 2) (= v_~__unbuffered_p3_EAX~0_40 1) (= v_~x~0_49 2))) 1 0) 0) 0 1)) (= v_~z$w_buff1~0_171 v_~z$w_buff1~0_170) (= v_~z$flush_delayed~0_69 0) (= v_~z$r_buff1_thd0~0_195 (ite .cse0 v_~z$r_buff1_thd0~0_196 (ite (let ((.cse11 (= (mod v_~z$r_buff0_thd0~0_196 256) 0))) (or (and .cse10 .cse11) .cse4 (and .cse11 .cse7))) v_~z$r_buff1_thd0~0_196 0))) (= v_~weak$$choice2~0_66 |v_ULTIMATE.start_main_#t~nondet12#1_79|)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_326, ~z$w_buff0~0=v_~z$w_buff0~0_213, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_288, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_42, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_79|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_79|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_196, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_40, ~z~0=v_~z~0_250, ~y~0=v_~y~0_53, ~x~0=v_~x~0_49} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_58, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_325, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_287, ~z$w_buff1~0=v_~z$w_buff1~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z$flush_delayed~0=v_~z$flush_delayed~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_42, ~weak$$choice0~0=v_~weak$$choice0~0_43, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_196, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_40, ~z~0=v_~z~0_249, ~y~0=v_~y~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_66, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[~z$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z~0, ~weak$$choice2~0][79], [111#P1EXITtrue, 44#L784true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 105#P0EXITtrue, 118#L817true, P2Thread1of1ForFork0InUse, 103#L18true, 196#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), Black: 156#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 151#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 152#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(<= ~__unbuffered_p3_EAX~0 0), 148#true, Black: 171#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 182#true, Black: 175#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 166#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 173#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 185#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 187#(and (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(= ~y~0 0), 163#true]) [2022-12-05 20:24:09,314 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:24:09,314 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:24:09,314 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:24:09,314 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:24:09,330 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L784-->L791: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_90 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd3~0_19 (ite .cse1 0 v_~z$r_buff0_thd3~0_20)) (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_36 (ite .cse2 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_19 256) 0)))) 0 v_~z$r_buff1_thd3~0_18) v_~z$r_buff1_thd3~0_17)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][36], [111#P1EXITtrue, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 84#L754true, P3Thread1of1ForFork2InUse, 118#L817true, P2Thread1of1ForFork0InUse, 90#L791true, Black: 156#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 151#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 152#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(<= ~__unbuffered_p3_EAX~0 0), 193#(= ~y~0 1), 148#true, Black: 171#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 182#true, Black: 175#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 166#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 173#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 85#L862true, Black: 185#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 187#(and (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(= ~y~0 0), 163#true]) [2022-12-05 20:24:09,330 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-05 20:24:09,330 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-05 20:24:09,330 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-05 20:24:09,330 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-05 20:24:09,332 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L784-->L791: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_90 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd3~0_19 (ite .cse1 0 v_~z$r_buff0_thd3~0_20)) (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_36 (ite .cse2 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_19 256) 0)))) 0 v_~z$r_buff1_thd3~0_18) v_~z$r_buff1_thd3~0_17)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][36], [111#P1EXITtrue, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 84#L754true, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 90#L791true, Black: 156#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 151#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 152#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(<= ~__unbuffered_p3_EAX~0 0), 193#(= ~y~0 1), 148#true, Black: 171#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 175#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 182#true, Black: 166#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 173#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 85#L862true, 12#L820true, Black: 185#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 187#(and (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(= ~y~0 0), 163#true]) [2022-12-05 20:24:09,332 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:24:09,332 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:24:09,333 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:24:09,333 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:24:09,336 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([483] L862-->L18: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd0~0_196 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd0~0_197 256) 0))) (let ((.cse8 (not .cse6)) (.cse9 (and .cse6 (= (mod v_~z$w_buff1_used~0_288 256) 0))) (.cse5 (and .cse10 .cse6)) (.cse12 (= (mod v_~z$w_buff0_used~0_326 256) 0))) (let ((.cse2 (or .cse9 .cse5 .cse12)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~z~0_250 (ite .cse3 v_~z$w_buff0~0_213 v_~z$w_buff1~0_171))) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse4 (= (mod v_~z$w_buff0_used~0_325 256) 0)) (.cse7 (= (mod v_~z$w_buff1_used~0_287 256) 0))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| (mod v_~main$tmp_guard1~0_46 256)) (= v_~z~0_249 (ite .cse0 v_~z$mem_tmp~0_58 .cse1)) (= (ite .cse0 v_~z$w_buff0_used~0_326 (ite .cse2 v_~z$w_buff0_used~0_326 (ite .cse3 0 v_~z$w_buff0_used~0_326))) v_~z$w_buff0_used~0_325) (= v_~weak$$choice0~0_43 |v_ULTIMATE.start_main_#t~nondet11#1_79|) (= v_~z$r_buff0_thd0~0_196 (ite .cse0 v_~z$r_buff0_thd0~0_197 (ite (or .cse4 .cse5 (and .cse6 .cse7)) v_~z$r_buff0_thd0~0_197 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd0~0_197)))) (= v_~z$w_buff0~0_213 v_~z$w_buff0~0_212) (= v_~z$w_buff1_used~0_287 (ite .cse0 v_~z$w_buff1_used~0_288 (ite (or .cse9 .cse4 .cse5) v_~z$w_buff1_used~0_288 0))) (= v_~z$mem_tmp~0_58 v_~z~0_250) (= v_~main$tmp_guard1~0_46 (ite (= (ite (not (and (= .cse1 2) (= 0 v_~__unbuffered_p3_EBX~0_42) (= v_~y~0_53 2) (= v_~__unbuffered_p3_EAX~0_40 1) (= v_~x~0_49 2))) 1 0) 0) 0 1)) (= v_~z$w_buff1~0_171 v_~z$w_buff1~0_170) (= v_~z$flush_delayed~0_69 0) (= v_~z$r_buff1_thd0~0_195 (ite .cse0 v_~z$r_buff1_thd0~0_196 (ite (let ((.cse11 (= (mod v_~z$r_buff0_thd0~0_196 256) 0))) (or (and .cse10 .cse11) .cse4 (and .cse11 .cse7))) v_~z$r_buff1_thd0~0_196 0))) (= v_~weak$$choice2~0_66 |v_ULTIMATE.start_main_#t~nondet12#1_79|)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_326, ~z$w_buff0~0=v_~z$w_buff0~0_213, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_288, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_42, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_79|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_79|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_196, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_40, ~z~0=v_~z~0_250, ~y~0=v_~y~0_53, ~x~0=v_~x~0_49} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_58, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_325, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_287, ~z$w_buff1~0=v_~z$w_buff1~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z$flush_delayed~0=v_~z$flush_delayed~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_42, ~weak$$choice0~0=v_~weak$$choice0~0_43, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_196, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_40, ~z~0=v_~z~0_249, ~y~0=v_~y~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_66, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[~z$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z~0, ~weak$$choice2~0][79], [111#P1EXITtrue, 44#L784true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 84#L754true, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 103#L18true, 196#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), Black: 156#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 151#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 152#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(<= ~__unbuffered_p3_EAX~0 0), 148#true, Black: 171#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 182#true, Black: 175#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 166#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 173#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 12#L820true, Black: 185#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 187#(and (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(= ~y~0 0), 163#true]) [2022-12-05 20:24:09,336 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:24:09,336 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:24:09,336 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:24:09,336 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:24:09,446 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L784-->L791: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_90 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd3~0_19 (ite .cse1 0 v_~z$r_buff0_thd3~0_20)) (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_36 (ite .cse2 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_19 256) 0)))) 0 v_~z$r_buff1_thd3~0_18) v_~z$r_buff1_thd3~0_17)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][36], [111#P1EXITtrue, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 118#L817true, 105#P0EXITtrue, P2Thread1of1ForFork0InUse, 90#L791true, Black: 156#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 151#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 152#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(<= ~__unbuffered_p3_EAX~0 0), 193#(= ~y~0 1), 148#true, Black: 171#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 182#true, Black: 175#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 166#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 173#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 85#L862true, Black: 185#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 187#(and (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(= ~y~0 0), 163#true]) [2022-12-05 20:24:09,446 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-05 20:24:09,446 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-05 20:24:09,446 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-05 20:24:09,446 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-05 20:24:09,448 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L784-->L791: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_90 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd3~0_19 (ite .cse1 0 v_~z$r_buff0_thd3~0_20)) (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_36 (ite .cse2 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_19 256) 0)))) 0 v_~z$r_buff1_thd3~0_18) v_~z$r_buff1_thd3~0_17)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][36], [111#P1EXITtrue, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 105#P0EXITtrue, P2Thread1of1ForFork0InUse, 90#L791true, Black: 156#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 151#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 152#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(<= ~__unbuffered_p3_EAX~0 0), 193#(= ~y~0 1), 148#true, Black: 171#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 175#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), 182#true, Black: 166#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 173#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 85#L862true, 12#L820true, Black: 185#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 187#(and (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(= ~y~0 0), 163#true]) [2022-12-05 20:24:09,448 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 20:24:09,448 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:24:09,448 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:24:09,448 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:24:09,451 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([483] L862-->L18: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd0~0_196 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd0~0_197 256) 0))) (let ((.cse8 (not .cse6)) (.cse9 (and .cse6 (= (mod v_~z$w_buff1_used~0_288 256) 0))) (.cse5 (and .cse10 .cse6)) (.cse12 (= (mod v_~z$w_buff0_used~0_326 256) 0))) (let ((.cse2 (or .cse9 .cse5 .cse12)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~z~0_250 (ite .cse3 v_~z$w_buff0~0_213 v_~z$w_buff1~0_171))) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse4 (= (mod v_~z$w_buff0_used~0_325 256) 0)) (.cse7 (= (mod v_~z$w_buff1_used~0_287 256) 0))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| (mod v_~main$tmp_guard1~0_46 256)) (= v_~z~0_249 (ite .cse0 v_~z$mem_tmp~0_58 .cse1)) (= (ite .cse0 v_~z$w_buff0_used~0_326 (ite .cse2 v_~z$w_buff0_used~0_326 (ite .cse3 0 v_~z$w_buff0_used~0_326))) v_~z$w_buff0_used~0_325) (= v_~weak$$choice0~0_43 |v_ULTIMATE.start_main_#t~nondet11#1_79|) (= v_~z$r_buff0_thd0~0_196 (ite .cse0 v_~z$r_buff0_thd0~0_197 (ite (or .cse4 .cse5 (and .cse6 .cse7)) v_~z$r_buff0_thd0~0_197 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd0~0_197)))) (= v_~z$w_buff0~0_213 v_~z$w_buff0~0_212) (= v_~z$w_buff1_used~0_287 (ite .cse0 v_~z$w_buff1_used~0_288 (ite (or .cse9 .cse4 .cse5) v_~z$w_buff1_used~0_288 0))) (= v_~z$mem_tmp~0_58 v_~z~0_250) (= v_~main$tmp_guard1~0_46 (ite (= (ite (not (and (= .cse1 2) (= 0 v_~__unbuffered_p3_EBX~0_42) (= v_~y~0_53 2) (= v_~__unbuffered_p3_EAX~0_40 1) (= v_~x~0_49 2))) 1 0) 0) 0 1)) (= v_~z$w_buff1~0_171 v_~z$w_buff1~0_170) (= v_~z$flush_delayed~0_69 0) (= v_~z$r_buff1_thd0~0_195 (ite .cse0 v_~z$r_buff1_thd0~0_196 (ite (let ((.cse11 (= (mod v_~z$r_buff0_thd0~0_196 256) 0))) (or (and .cse10 .cse11) .cse4 (and .cse11 .cse7))) v_~z$r_buff1_thd0~0_196 0))) (= v_~weak$$choice2~0_66 |v_ULTIMATE.start_main_#t~nondet12#1_79|)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_326, ~z$w_buff0~0=v_~z$w_buff0~0_213, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_288, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_42, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_79|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_79|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_196, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_40, ~z~0=v_~z~0_250, ~y~0=v_~y~0_53, ~x~0=v_~x~0_49} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_58, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_325, ~z$w_buff0~0=v_~z$w_buff0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_287, ~z$w_buff1~0=v_~z$w_buff1~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z$flush_delayed~0=v_~z$flush_delayed~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_42, ~weak$$choice0~0=v_~weak$$choice0~0_43, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_196, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_40, ~z~0=v_~z~0_249, ~y~0=v_~y~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_66, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[~z$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z~0, ~weak$$choice2~0][79], [111#P1EXITtrue, 44#L784true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 105#P0EXITtrue, P2Thread1of1ForFork0InUse, 103#L18true, 196#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~y~0 1)), Black: 156#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 151#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 152#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 150#(<= ~__unbuffered_p3_EAX~0 0), 148#true, Black: 171#(and (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 182#true, Black: 175#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z$r_buff1_thd0~0 0)), Black: 166#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 173#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 12#L820true, Black: 185#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 187#(and (= ~y~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(= ~y~0 0), 163#true]) [2022-12-05 20:24:09,451 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 20:24:09,452 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:24:09,452 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:24:09,452 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:24:09,845 INFO L130 PetriNetUnfolder]: 11300/16276 cut-off events. [2022-12-05 20:24:09,845 INFO L131 PetriNetUnfolder]: For 65890/66384 co-relation queries the response was YES. [2022-12-05 20:24:09,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67260 conditions, 16276 events. 11300/16276 cut-off events. For 65890/66384 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 98474 event pairs, 3793 based on Foata normal form. 441/15733 useless extension candidates. Maximal degree in co-relation 67234. Up to 7221 conditions per place. [2022-12-05 20:24:09,921 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 59 selfloop transitions, 8 changer transitions 23/104 dead transitions. [2022-12-05 20:24:09,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 104 transitions, 912 flow [2022-12-05 20:24:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:24:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:24:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-05 20:24:09,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48125 [2022-12-05 20:24:09,922 INFO L175 Difference]: Start difference. First operand has 59 places, 61 transitions, 474 flow. Second operand 5 states and 77 transitions. [2022-12-05 20:24:09,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 104 transitions, 912 flow [2022-12-05 20:24:09,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 104 transitions, 893 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:09,960 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 491 flow [2022-12-05 20:24:09,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=491, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2022-12-05 20:24:09,962 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places. [2022-12-05 20:24:09,962 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 491 flow [2022-12-05 20:24:09,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-05 20:24:09,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:09,962 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:09,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:24:09,963 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:09,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:09,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1249654121, now seen corresponding path program 1 times [2022-12-05 20:24:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:09,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855658042] [2022-12-05 20:24:09,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:10,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-05 20:24:10,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:10,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855658042] [2022-12-05 20:24:10,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855658042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:10,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:10,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:10,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593635525] [2022-12-05 20:24:10,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:10,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:24:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:10,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:24:10,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:24:10,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-05 20:24:10,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-05 20:24:10,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:10,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-05 20:24:10,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:11,678 INFO L130 PetriNetUnfolder]: 10617/15730 cut-off events. [2022-12-05 20:24:11,678 INFO L131 PetriNetUnfolder]: For 73580/73914 co-relation queries the response was YES. [2022-12-05 20:24:11,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64340 conditions, 15730 events. 10617/15730 cut-off events. For 73580/73914 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 96504 event pairs, 2495 based on Foata normal form. 553/16015 useless extension candidates. Maximal degree in co-relation 64312. Up to 10242 conditions per place. [2022-12-05 20:24:11,776 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 69 selfloop transitions, 12 changer transitions 19/115 dead transitions. [2022-12-05 20:24:11,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 115 transitions, 1060 flow [2022-12-05 20:24:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:24:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:24:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-05 20:24:11,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2022-12-05 20:24:11,777 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 491 flow. Second operand 6 states and 85 transitions. [2022-12-05 20:24:11,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 115 transitions, 1060 flow [2022-12-05 20:24:11,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 115 transitions, 1028 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-05 20:24:11,823 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 585 flow [2022-12-05 20:24:11,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=585, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2022-12-05 20:24:11,829 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2022-12-05 20:24:11,829 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 585 flow [2022-12-05 20:24:11,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-05 20:24:11,829 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:11,829 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:11,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:24:11,830 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:11,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:11,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1708882030, now seen corresponding path program 1 times [2022-12-05 20:24:11,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:11,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491398501] [2022-12-05 20:24:11,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:11,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:12,074 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-05 20:24:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:12,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491398501] [2022-12-05 20:24:12,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491398501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:12,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:12,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:24:12,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590580391] [2022-12-05 20:24:12,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:12,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:24:12,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:12,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:24:12,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:24:12,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-05 20:24:12,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 585 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-05 20:24:12,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:12,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-05 20:24:12,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:13,864 INFO L130 PetriNetUnfolder]: 14638/20385 cut-off events. [2022-12-05 20:24:13,864 INFO L131 PetriNetUnfolder]: For 82723/82723 co-relation queries the response was YES. [2022-12-05 20:24:13,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87705 conditions, 20385 events. 14638/20385 cut-off events. For 82723/82723 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 111860 event pairs, 2274 based on Foata normal form. 362/20747 useless extension candidates. Maximal degree in co-relation 87674. Up to 12241 conditions per place. [2022-12-05 20:24:13,975 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 81 selfloop transitions, 42 changer transitions 35/158 dead transitions. [2022-12-05 20:24:13,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 158 transitions, 1522 flow [2022-12-05 20:24:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:24:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:24:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-05 20:24:13,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2022-12-05 20:24:13,977 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 585 flow. Second operand 7 states and 106 transitions. [2022-12-05 20:24:13,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 158 transitions, 1522 flow [2022-12-05 20:24:14,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 158 transitions, 1514 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 20:24:14,064 INFO L231 Difference]: Finished difference. Result has 75 places, 86 transitions, 937 flow [2022-12-05 20:24:14,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=937, PETRI_PLACES=75, PETRI_TRANSITIONS=86} [2022-12-05 20:24:14,065 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2022-12-05 20:24:14,065 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 86 transitions, 937 flow [2022-12-05 20:24:14,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-05 20:24:14,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:14,065 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:14,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:24:14,065 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:14,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:14,066 INFO L85 PathProgramCache]: Analyzing trace with hash 539286503, now seen corresponding path program 1 times [2022-12-05 20:24:14,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:14,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705165595] [2022-12-05 20:24:14,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:14,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:14,491 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-05 20:24:14,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:14,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705165595] [2022-12-05 20:24:14,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705165595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:14,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:14,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:24:14,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892392843] [2022-12-05 20:24:14,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:14,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:24:14,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:14,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:24:14,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:24:14,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-05 20:24:14,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 86 transitions, 937 flow. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-05 20:24:14,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:14,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-05 20:24:14,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:16,558 INFO L130 PetriNetUnfolder]: 16144/22589 cut-off events. [2022-12-05 20:24:16,558 INFO L131 PetriNetUnfolder]: For 154829/154829 co-relation queries the response was YES. [2022-12-05 20:24:16,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114318 conditions, 22589 events. 16144/22589 cut-off events. For 154829/154829 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 125966 event pairs, 3328 based on Foata normal form. 424/23013 useless extension candidates. Maximal degree in co-relation 114280. Up to 16852 conditions per place. [2022-12-05 20:24:16,680 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 147 selfloop transitions, 39 changer transitions 34/220 dead transitions. [2022-12-05 20:24:16,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 220 transitions, 2744 flow [2022-12-05 20:24:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:24:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:24:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-12-05 20:24:16,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2022-12-05 20:24:16,682 INFO L175 Difference]: Start difference. First operand has 75 places, 86 transitions, 937 flow. Second operand 8 states and 93 transitions. [2022-12-05 20:24:16,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 220 transitions, 2744 flow [2022-12-05 20:24:16,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 220 transitions, 2726 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-05 20:24:16,835 INFO L231 Difference]: Finished difference. Result has 81 places, 119 transitions, 1498 flow [2022-12-05 20:24:16,835 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1498, PETRI_PLACES=81, PETRI_TRANSITIONS=119} [2022-12-05 20:24:16,837 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2022-12-05 20:24:16,837 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 119 transitions, 1498 flow [2022-12-05 20:24:16,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-05 20:24:16,837 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:16,837 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:16,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:24:16,837 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:16,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:16,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1922465223, now seen corresponding path program 2 times [2022-12-05 20:24:16,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:16,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610910625] [2022-12-05 20:24:16,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:16,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:17,350 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-05 20:24:17,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:17,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610910625] [2022-12-05 20:24:17,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610910625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:17,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:17,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:24:17,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501591000] [2022-12-05 20:24:17,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:17,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:24:17,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:17,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:24:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:24:17,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-05 20:24:17,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 119 transitions, 1498 flow. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-05 20:24:17,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:17,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-05 20:24:17,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:19,907 INFO L130 PetriNetUnfolder]: 17728/24871 cut-off events. [2022-12-05 20:24:19,907 INFO L131 PetriNetUnfolder]: For 192481/192481 co-relation queries the response was YES. [2022-12-05 20:24:20,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137046 conditions, 24871 events. 17728/24871 cut-off events. For 192481/192481 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 141072 event pairs, 3051 based on Foata normal form. 458/25329 useless extension candidates. Maximal degree in co-relation 137004. Up to 18465 conditions per place. [2022-12-05 20:24:20,082 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 177 selfloop transitions, 99 changer transitions 39/315 dead transitions. [2022-12-05 20:24:20,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 315 transitions, 4302 flow [2022-12-05 20:24:20,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:24:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:24:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2022-12-05 20:24:20,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2022-12-05 20:24:20,084 INFO L175 Difference]: Start difference. First operand has 81 places, 119 transitions, 1498 flow. Second operand 9 states and 116 transitions. [2022-12-05 20:24:20,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 315 transitions, 4302 flow [2022-12-05 20:24:20,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 315 transitions, 4241 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-05 20:24:20,343 INFO L231 Difference]: Finished difference. Result has 91 places, 205 transitions, 3054 flow [2022-12-05 20:24:20,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3054, PETRI_PLACES=91, PETRI_TRANSITIONS=205} [2022-12-05 20:24:20,344 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 47 predicate places. [2022-12-05 20:24:20,344 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 205 transitions, 3054 flow [2022-12-05 20:24:20,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-05 20:24:20,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:20,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:20,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:24:20,344 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:20,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:20,345 INFO L85 PathProgramCache]: Analyzing trace with hash 463720605, now seen corresponding path program 3 times [2022-12-05 20:24:20,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:20,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248085550] [2022-12-05 20:24:20,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:20,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:20,670 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-05 20:24:20,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:20,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248085550] [2022-12-05 20:24:20,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248085550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:20,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:20,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:20,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801933609] [2022-12-05 20:24:20,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:20,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:24:20,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:20,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:24:20,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:24:20,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-05 20:24:20,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 205 transitions, 3054 flow. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-05 20:24:20,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:20,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-05 20:24:20,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:23,753 INFO L130 PetriNetUnfolder]: 19481/27416 cut-off events. [2022-12-05 20:24:23,753 INFO L131 PetriNetUnfolder]: For 266414/266414 co-relation queries the response was YES. [2022-12-05 20:24:23,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168160 conditions, 27416 events. 19481/27416 cut-off events. For 266414/266414 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 160051 event pairs, 1954 based on Foata normal form. 588/28004 useless extension candidates. Maximal degree in co-relation 168112. Up to 13071 conditions per place. [2022-12-05 20:24:24,000 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 122 selfloop transitions, 165 changer transitions 35/322 dead transitions. [2022-12-05 20:24:24,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 322 transitions, 5054 flow [2022-12-05 20:24:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:24:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:24:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-12-05 20:24:24,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.390625 [2022-12-05 20:24:24,002 INFO L175 Difference]: Start difference. First operand has 91 places, 205 transitions, 3054 flow. Second operand 8 states and 100 transitions. [2022-12-05 20:24:24,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 322 transitions, 5054 flow [2022-12-05 20:24:24,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 322 transitions, 4938 flow, removed 58 selfloop flow, removed 1 redundant places. [2022-12-05 20:24:24,449 INFO L231 Difference]: Finished difference. Result has 101 places, 247 transitions, 4308 flow [2022-12-05 20:24:24,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2962, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4308, PETRI_PLACES=101, PETRI_TRANSITIONS=247} [2022-12-05 20:24:24,450 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2022-12-05 20:24:24,450 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 247 transitions, 4308 flow [2022-12-05 20:24:24,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-05 20:24:24,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:24,450 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:24,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:24:24,450 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:24,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:24,451 INFO L85 PathProgramCache]: Analyzing trace with hash 463461135, now seen corresponding path program 4 times [2022-12-05 20:24:24,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:24,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500126668] [2022-12-05 20:24:24,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:24,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:24,895 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-05 20:24:24,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:24,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500126668] [2022-12-05 20:24:24,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500126668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:24,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:24,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:24:24,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020405962] [2022-12-05 20:24:24,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:24,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:24:24,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:24,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:24:24,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:24:24,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-05 20:24:24,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 247 transitions, 4308 flow. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-05 20:24:24,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:24,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-05 20:24:24,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:28,811 INFO L130 PetriNetUnfolder]: 19272/27155 cut-off events. [2022-12-05 20:24:28,812 INFO L131 PetriNetUnfolder]: For 346807/346807 co-relation queries the response was YES. [2022-12-05 20:24:28,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188898 conditions, 27155 events. 19272/27155 cut-off events. For 346807/346807 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 158863 event pairs, 1481 based on Foata normal form. 448/27603 useless extension candidates. Maximal degree in co-relation 188843. Up to 11691 conditions per place. [2022-12-05 20:24:29,018 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 146 selfloop transitions, 200 changer transitions 33/379 dead transitions. [2022-12-05 20:24:29,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 379 transitions, 6800 flow [2022-12-05 20:24:29,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 20:24:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 20:24:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-12-05 20:24:29,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.390625 [2022-12-05 20:24:29,020 INFO L175 Difference]: Start difference. First operand has 101 places, 247 transitions, 4308 flow. Second operand 10 states and 125 transitions. [2022-12-05 20:24:29,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 379 transitions, 6800 flow [2022-12-05 20:24:29,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 379 transitions, 6666 flow, removed 57 selfloop flow, removed 3 redundant places. [2022-12-05 20:24:29,826 INFO L231 Difference]: Finished difference. Result has 111 places, 285 transitions, 5738 flow [2022-12-05 20:24:29,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4240, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5738, PETRI_PLACES=111, PETRI_TRANSITIONS=285} [2022-12-05 20:24:29,826 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 67 predicate places. [2022-12-05 20:24:29,826 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 285 transitions, 5738 flow [2022-12-05 20:24:29,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-05 20:24:29,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:29,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:29,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:24:29,827 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:29,827 INFO L85 PathProgramCache]: Analyzing trace with hash -339266323, now seen corresponding path program 5 times [2022-12-05 20:24:29,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:29,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413953506] [2022-12-05 20:24:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:29,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:30,114 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-05 20:24:30,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:30,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413953506] [2022-12-05 20:24:30,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413953506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:30,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:30,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:24:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069802815] [2022-12-05 20:24:30,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:30,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:24:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:30,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:24:30,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:24:30,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-05 20:24:30,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 285 transitions, 5738 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-05 20:24:30,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:30,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-05 20:24:30,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:33,767 INFO L130 PetriNetUnfolder]: 16746/24808 cut-off events. [2022-12-05 20:24:33,768 INFO L131 PetriNetUnfolder]: For 462449/464066 co-relation queries the response was YES. [2022-12-05 20:24:33,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194032 conditions, 24808 events. 16746/24808 cut-off events. For 462449/464066 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 163839 event pairs, 1778 based on Foata normal form. 1043/25236 useless extension candidates. Maximal degree in co-relation 193972. Up to 11870 conditions per place. [2022-12-05 20:24:34,005 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 176 selfloop transitions, 85 changer transitions 21/351 dead transitions. [2022-12-05 20:24:34,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 351 transitions, 7198 flow [2022-12-05 20:24:34,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:24:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:24:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-05 20:24:34,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-05 20:24:34,006 INFO L175 Difference]: Start difference. First operand has 111 places, 285 transitions, 5738 flow. Second operand 8 states and 104 transitions. [2022-12-05 20:24:34,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 351 transitions, 7198 flow [2022-12-05 20:24:34,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 351 transitions, 7191 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-05 20:24:34,891 INFO L231 Difference]: Finished difference. Result has 118 places, 291 transitions, 6159 flow [2022-12-05 20:24:34,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5731, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6159, PETRI_PLACES=118, PETRI_TRANSITIONS=291} [2022-12-05 20:24:34,892 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 74 predicate places. [2022-12-05 20:24:34,892 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 291 transitions, 6159 flow [2022-12-05 20:24:34,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-05 20:24:34,892 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:34,892 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:34,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:24:34,892 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:34,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:34,893 INFO L85 PathProgramCache]: Analyzing trace with hash 483645820, now seen corresponding path program 1 times [2022-12-05 20:24:34,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:34,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698548360] [2022-12-05 20:24:34,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:34,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:35,309 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-05 20:24:35,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:35,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698548360] [2022-12-05 20:24:35,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698548360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:35,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:35,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:24:35,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199630500] [2022-12-05 20:24:35,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:35,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:24:35,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:35,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:24:35,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:24:35,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-05 20:24:35,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 291 transitions, 6159 flow. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-05 20:24:35,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:35,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-05 20:24:35,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:39,318 INFO L130 PetriNetUnfolder]: 17646/26121 cut-off events. [2022-12-05 20:24:39,319 INFO L131 PetriNetUnfolder]: For 558436/559947 co-relation queries the response was YES. [2022-12-05 20:24:39,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213221 conditions, 26121 events. 17646/26121 cut-off events. For 558436/559947 co-relation queries the response was YES. Maximal size of possible extension queue 1411. Compared 174759 event pairs, 3019 based on Foata normal form. 583/25909 useless extension candidates. Maximal degree in co-relation 213157. Up to 16526 conditions per place. [2022-12-05 20:24:39,564 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 212 selfloop transitions, 55 changer transitions 14/350 dead transitions. [2022-12-05 20:24:39,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 350 transitions, 7438 flow [2022-12-05 20:24:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:24:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:24:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-05 20:24:39,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2022-12-05 20:24:39,566 INFO L175 Difference]: Start difference. First operand has 118 places, 291 transitions, 6159 flow. Second operand 8 states and 107 transitions. [2022-12-05 20:24:39,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 350 transitions, 7438 flow [2022-12-05 20:24:40,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 350 transitions, 7366 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-05 20:24:40,756 INFO L231 Difference]: Finished difference. Result has 121 places, 294 transitions, 6333 flow [2022-12-05 20:24:40,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6089, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6333, PETRI_PLACES=121, PETRI_TRANSITIONS=294} [2022-12-05 20:24:40,757 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 77 predicate places. [2022-12-05 20:24:40,757 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 294 transitions, 6333 flow [2022-12-05 20:24:40,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-05 20:24:40,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:40,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:40,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:24:40,757 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash -35625398, now seen corresponding path program 2 times [2022-12-05 20:24:40,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:40,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156586555] [2022-12-05 20:24:40,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:40,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:41,309 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-05 20:24:41,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:41,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156586555] [2022-12-05 20:24:41,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156586555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:41,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:41,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:24:41,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177283160] [2022-12-05 20:24:41,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:41,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:24:41,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:41,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:24:41,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:24:41,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-05 20:24:41,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 294 transitions, 6333 flow. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-05 20:24:41,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:41,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-05 20:24:41,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:45,370 INFO L130 PetriNetUnfolder]: 17884/26541 cut-off events. [2022-12-05 20:24:45,371 INFO L131 PetriNetUnfolder]: For 584945/586192 co-relation queries the response was YES. [2022-12-05 20:24:45,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219562 conditions, 26541 events. 17884/26541 cut-off events. For 584945/586192 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 179892 event pairs, 6403 based on Foata normal form. 576/26136 useless extension candidates. Maximal degree in co-relation 219498. Up to 15850 conditions per place. [2022-12-05 20:24:45,780 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 209 selfloop transitions, 48 changer transitions 14/340 dead transitions. [2022-12-05 20:24:45,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 340 transitions, 7507 flow [2022-12-05 20:24:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:24:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:24:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2022-12-05 20:24:45,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-05 20:24:45,781 INFO L175 Difference]: Start difference. First operand has 121 places, 294 transitions, 6333 flow. Second operand 7 states and 88 transitions. [2022-12-05 20:24:45,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 340 transitions, 7507 flow [2022-12-05 20:24:47,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 340 transitions, 7401 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-05 20:24:47,282 INFO L231 Difference]: Finished difference. Result has 123 places, 296 transitions, 6432 flow [2022-12-05 20:24:47,283 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6239, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6432, PETRI_PLACES=123, PETRI_TRANSITIONS=296} [2022-12-05 20:24:47,284 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 79 predicate places. [2022-12-05 20:24:47,284 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 296 transitions, 6432 flow [2022-12-05 20:24:47,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-05 20:24:47,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:47,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:47,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 20:24:47,284 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:47,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:47,284 INFO L85 PathProgramCache]: Analyzing trace with hash -368092958, now seen corresponding path program 3 times [2022-12-05 20:24:47,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:47,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195403948] [2022-12-05 20:24:47,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:47,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:47,784 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-05 20:24:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:47,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195403948] [2022-12-05 20:24:47,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195403948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:47,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:47,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:24:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532079038] [2022-12-05 20:24:47,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:47,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:24:47,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:47,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:24:47,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:24:47,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-05 20:24:47,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 296 transitions, 6432 flow. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-05 20:24:47,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:47,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-05 20:24:47,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:52,028 INFO L130 PetriNetUnfolder]: 18499/27712 cut-off events. [2022-12-05 20:24:52,028 INFO L131 PetriNetUnfolder]: For 641312/642969 co-relation queries the response was YES. [2022-12-05 20:24:52,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230307 conditions, 27712 events. 18499/27712 cut-off events. For 641312/642969 co-relation queries the response was YES. Maximal size of possible extension queue 1577. Compared 191961 event pairs, 2654 based on Foata normal form. 684/27606 useless extension candidates. Maximal degree in co-relation 230242. Up to 17023 conditions per place. [2022-12-05 20:24:52,340 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 236 selfloop transitions, 39 changer transitions 9/353 dead transitions. [2022-12-05 20:24:52,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 353 transitions, 7844 flow [2022-12-05 20:24:52,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:24:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:24:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-05 20:24:52,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-05 20:24:52,342 INFO L175 Difference]: Start difference. First operand has 123 places, 296 transitions, 6432 flow. Second operand 6 states and 84 transitions. [2022-12-05 20:24:52,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 353 transitions, 7844 flow [2022-12-05 20:24:53,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 353 transitions, 7733 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-05 20:24:53,689 INFO L231 Difference]: Finished difference. Result has 123 places, 307 transitions, 6719 flow [2022-12-05 20:24:53,689 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6331, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6719, PETRI_PLACES=123, PETRI_TRANSITIONS=307} [2022-12-05 20:24:53,689 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 79 predicate places. [2022-12-05 20:24:53,690 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 307 transitions, 6719 flow [2022-12-05 20:24:53,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-05 20:24:53,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:53,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:53,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 20:24:53,690 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1780228756, now seen corresponding path program 1 times [2022-12-05 20:24:53,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:53,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947410891] [2022-12-05 20:24:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:53,771 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-05 20:24:53,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:53,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947410891] [2022-12-05 20:24:53,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947410891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:53,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:53,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:24:53,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728192086] [2022-12-05 20:24:53,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:53,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:24:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:53,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:24:53,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:24:53,772 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2022-12-05 20:24:53,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 307 transitions, 6719 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-05 20:24:53,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:53,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2022-12-05 20:24:53,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:57,168 INFO L130 PetriNetUnfolder]: 13838/20974 cut-off events. [2022-12-05 20:24:57,168 INFO L131 PetriNetUnfolder]: For 625549/634355 co-relation queries the response was YES. [2022-12-05 20:24:57,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176224 conditions, 20974 events. 13838/20974 cut-off events. For 625549/634355 co-relation queries the response was YES. Maximal size of possible extension queue 1538. Compared 149418 event pairs, 2269 based on Foata normal form. 4364/24310 useless extension candidates. Maximal degree in co-relation 176159. Up to 13000 conditions per place. [2022-12-05 20:24:57,536 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 441 selfloop transitions, 10 changer transitions 76/601 dead transitions. [2022-12-05 20:24:57,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 601 transitions, 14427 flow [2022-12-05 20:24:57,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:24:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:24:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-05 20:24:57,537 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-05 20:24:57,537 INFO L175 Difference]: Start difference. First operand has 123 places, 307 transitions, 6719 flow. Second operand 5 states and 86 transitions. [2022-12-05 20:24:57,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 601 transitions, 14427 flow [2022-12-05 20:24:58,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 601 transitions, 14301 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-05 20:24:58,081 INFO L231 Difference]: Finished difference. Result has 126 places, 296 transitions, 6329 flow [2022-12-05 20:24:58,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6208, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6329, PETRI_PLACES=126, PETRI_TRANSITIONS=296} [2022-12-05 20:24:58,081 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 82 predicate places. [2022-12-05 20:24:58,081 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 296 transitions, 6329 flow [2022-12-05 20:24:58,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-05 20:24:58,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:58,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:58,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 20:24:58,082 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:24:58,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1415130726, now seen corresponding path program 1 times [2022-12-05 20:24:58,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:58,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852470663] [2022-12-05 20:24:58,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:58,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:58,555 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-05 20:24:58,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:58,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852470663] [2022-12-05 20:24:58,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852470663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:58,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:58,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:24:58,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146877357] [2022-12-05 20:24:58,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:58,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:24:58,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:58,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:24:58,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:24:58,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-05 20:24:58,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 296 transitions, 6329 flow. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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-05 20:24:58,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:58,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-05 20:24:58,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:02,701 INFO L130 PetriNetUnfolder]: 15673/24705 cut-off events. [2022-12-05 20:25:02,701 INFO L131 PetriNetUnfolder]: For 571149/573828 co-relation queries the response was YES. [2022-12-05 20:25:02,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213999 conditions, 24705 events. 15673/24705 cut-off events. For 571149/573828 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 184536 event pairs, 2039 based on Foata normal form. 879/25112 useless extension candidates. Maximal degree in co-relation 213931. Up to 11315 conditions per place. [2022-12-05 20:25:02,951 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 233 selfloop transitions, 36 changer transitions 28/363 dead transitions. [2022-12-05 20:25:02,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 363 transitions, 7821 flow [2022-12-05 20:25:02,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:25:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:25:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2022-12-05 20:25:02,952 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-05 20:25:02,952 INFO L175 Difference]: Start difference. First operand has 126 places, 296 transitions, 6329 flow. Second operand 7 states and 88 transitions. [2022-12-05 20:25:02,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 363 transitions, 7821 flow [2022-12-05 20:25:04,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 363 transitions, 7771 flow, removed 19 selfloop flow, removed 1 redundant places. [2022-12-05 20:25:04,197 INFO L231 Difference]: Finished difference. Result has 134 places, 295 transitions, 6426 flow [2022-12-05 20:25:04,197 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6300, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6426, PETRI_PLACES=134, PETRI_TRANSITIONS=295} [2022-12-05 20:25:04,197 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 90 predicate places. [2022-12-05 20:25:04,197 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 295 transitions, 6426 flow [2022-12-05 20:25:04,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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-05 20:25:04,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:04,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:25:04,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 20:25:04,198 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:25:04,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:04,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2036394588, now seen corresponding path program 1 times [2022-12-05 20:25:04,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:04,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825630325] [2022-12-05 20:25:04,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:04,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:25:04,308 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-05 20:25:04,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:25:04,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825630325] [2022-12-05 20:25:04,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825630325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:25:04,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:25:04,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:25:04,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188164895] [2022-12-05 20:25:04,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:25:04,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:25:04,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:25:04,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:25:04,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:25:04,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2022-12-05 20:25:04,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 295 transitions, 6426 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-05 20:25:04,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:25:04,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2022-12-05 20:25:04,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:06,813 INFO L130 PetriNetUnfolder]: 9771/15536 cut-off events. [2022-12-05 20:25:06,813 INFO L131 PetriNetUnfolder]: For 515543/528776 co-relation queries the response was YES. [2022-12-05 20:25:06,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133966 conditions, 15536 events. 9771/15536 cut-off events. For 515543/528776 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 115355 event pairs, 676 based on Foata normal form. 5609/20596 useless extension candidates. Maximal degree in co-relation 133894. Up to 6455 conditions per place. [2022-12-05 20:25:06,940 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 600 selfloop transitions, 17 changer transitions 29/717 dead transitions. [2022-12-05 20:25:06,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 717 transitions, 17448 flow [2022-12-05 20:25:06,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:25:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:25:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-12-05 20:25:06,941 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-05 20:25:06,941 INFO L175 Difference]: Start difference. First operand has 134 places, 295 transitions, 6426 flow. Second operand 7 states and 119 transitions. [2022-12-05 20:25:06,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 717 transitions, 17448 flow [2022-12-05 20:25:07,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 717 transitions, 16908 flow, removed 171 selfloop flow, removed 8 redundant places. [2022-12-05 20:25:07,543 INFO L231 Difference]: Finished difference. Result has 133 places, 265 transitions, 5459 flow [2022-12-05 20:25:07,543 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5401, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5459, PETRI_PLACES=133, PETRI_TRANSITIONS=265} [2022-12-05 20:25:07,543 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places. [2022-12-05 20:25:07,543 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 265 transitions, 5459 flow [2022-12-05 20:25:07,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-05 20:25:07,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:07,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:25:07,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 20:25:07,544 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:25:07,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:07,544 INFO L85 PathProgramCache]: Analyzing trace with hash -330767423, now seen corresponding path program 1 times [2022-12-05 20:25:07,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:07,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599611885] [2022-12-05 20:25:07,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:07,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:25:07,737 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-05 20:25:07,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:25:07,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599611885] [2022-12-05 20:25:07,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599611885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:25:07,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:25:07,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:25:07,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26356809] [2022-12-05 20:25:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:25:07,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:25:07,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:25:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:25:07,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:25:07,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-05 20:25:07,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 265 transitions, 5459 flow. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-05 20:25:07,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:25:07,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-05 20:25:07,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:12,106 INFO L130 PetriNetUnfolder]: 17603/27307 cut-off events. [2022-12-05 20:25:12,107 INFO L131 PetriNetUnfolder]: For 620921/620921 co-relation queries the response was YES. [2022-12-05 20:25:12,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244848 conditions, 27307 events. 17603/27307 cut-off events. For 620921/620921 co-relation queries the response was YES. Maximal size of possible extension queue 1321. Compared 195483 event pairs, 3206 based on Foata normal form. 111/27418 useless extension candidates. Maximal degree in co-relation 244778. Up to 13983 conditions per place. [2022-12-05 20:25:12,319 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 234 selfloop transitions, 63 changer transitions 168/465 dead transitions. [2022-12-05 20:25:12,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 465 transitions, 10164 flow [2022-12-05 20:25:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:25:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:25:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-05 20:25:12,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42410714285714285 [2022-12-05 20:25:12,321 INFO L175 Difference]: Start difference. First operand has 133 places, 265 transitions, 5459 flow. Second operand 7 states and 95 transitions. [2022-12-05 20:25:12,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 465 transitions, 10164 flow [2022-12-05 20:25:15,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 465 transitions, 10014 flow, removed 56 selfloop flow, removed 3 redundant places. [2022-12-05 20:25:15,147 INFO L231 Difference]: Finished difference. Result has 141 places, 227 transitions, 4962 flow [2022-12-05 20:25:15,147 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5405, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4962, PETRI_PLACES=141, PETRI_TRANSITIONS=227} [2022-12-05 20:25:15,147 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 97 predicate places. [2022-12-05 20:25:15,147 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 227 transitions, 4962 flow [2022-12-05 20:25:15,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-05 20:25:15,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:15,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:25:15,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-05 20:25:15,148 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:25:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2115066709, now seen corresponding path program 1 times [2022-12-05 20:25:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:15,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115686343] [2022-12-05 20:25:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:25:15,242 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-05 20:25:15,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:25:15,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115686343] [2022-12-05 20:25:15,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115686343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:25:15,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:25:15,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:25:15,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804108531] [2022-12-05 20:25:15,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:25:15,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:25:15,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:25:15,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:25:15,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:25:15,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2022-12-05 20:25:15,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 227 transitions, 4962 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-05 20:25:15,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:25:15,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2022-12-05 20:25:15,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:16,326 INFO L130 PetriNetUnfolder]: 3947/6836 cut-off events. [2022-12-05 20:25:16,326 INFO L131 PetriNetUnfolder]: For 213454/216610 co-relation queries the response was YES. [2022-12-05 20:25:16,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57981 conditions, 6836 events. 3947/6836 cut-off events. For 213454/216610 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 48908 event pairs, 268 based on Foata normal form. 1779/8436 useless extension candidates. Maximal degree in co-relation 57906. Up to 2493 conditions per place. [2022-12-05 20:25:16,369 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 273 selfloop transitions, 17 changer transitions 110/451 dead transitions. [2022-12-05 20:25:16,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 451 transitions, 11062 flow [2022-12-05 20:25:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:25:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:25:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2022-12-05 20:25:16,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2022-12-05 20:25:16,370 INFO L175 Difference]: Start difference. First operand has 141 places, 227 transitions, 4962 flow. Second operand 7 states and 122 transitions. [2022-12-05 20:25:16,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 451 transitions, 11062 flow [2022-12-05 20:25:16,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 451 transitions, 10619 flow, removed 102 selfloop flow, removed 15 redundant places. [2022-12-05 20:25:16,634 INFO L231 Difference]: Finished difference. Result has 128 places, 179 transitions, 3672 flow [2022-12-05 20:25:16,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4029, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3672, PETRI_PLACES=128, PETRI_TRANSITIONS=179} [2022-12-05 20:25:16,635 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 84 predicate places. [2022-12-05 20:25:16,635 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 179 transitions, 3672 flow [2022-12-05 20:25:16,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-05 20:25:16,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:16,635 INFO L213 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] [2022-12-05 20:25:16,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-05 20:25:16,635 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:25:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash 708874509, now seen corresponding path program 1 times [2022-12-05 20:25:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:16,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151142153] [2022-12-05 20:25:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:25:16,884 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-05 20:25:16,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:25:16,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151142153] [2022-12-05 20:25:16,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151142153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:25:16,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:25:16,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:25:16,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707333174] [2022-12-05 20:25:16,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:25:16,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:25:16,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:25:16,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:25:16,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:25:16,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-05 20:25:16,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 179 transitions, 3672 flow. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-05 20:25:16,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:25:16,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-05 20:25:16,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:18,651 INFO L130 PetriNetUnfolder]: 6184/10927 cut-off events. [2022-12-05 20:25:18,651 INFO L131 PetriNetUnfolder]: For 223417/223417 co-relation queries the response was YES. [2022-12-05 20:25:18,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93143 conditions, 10927 events. 6184/10927 cut-off events. For 223417/223417 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 82292 event pairs, 729 based on Foata normal form. 16/10943 useless extension candidates. Maximal degree in co-relation 93094. Up to 4295 conditions per place. [2022-12-05 20:25:18,702 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 128 selfloop transitions, 45 changer transitions 222/395 dead transitions. [2022-12-05 20:25:18,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 395 transitions, 8168 flow [2022-12-05 20:25:18,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:25:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:25:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-12-05 20:25:18,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48660714285714285 [2022-12-05 20:25:18,703 INFO L175 Difference]: Start difference. First operand has 128 places, 179 transitions, 3672 flow. Second operand 7 states and 109 transitions. [2022-12-05 20:25:18,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 395 transitions, 8168 flow [2022-12-05 20:25:19,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 395 transitions, 7663 flow, removed 143 selfloop flow, removed 7 redundant places. [2022-12-05 20:25:19,504 INFO L231 Difference]: Finished difference. Result has 130 places, 121 transitions, 2419 flow [2022-12-05 20:25:19,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3466, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2419, PETRI_PLACES=130, PETRI_TRANSITIONS=121} [2022-12-05 20:25:19,504 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 86 predicate places. [2022-12-05 20:25:19,504 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 121 transitions, 2419 flow [2022-12-05 20:25:19,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-05 20:25:19,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:19,505 INFO L213 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] [2022-12-05 20:25:19,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-05 20:25:19,505 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:25:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:19,505 INFO L85 PathProgramCache]: Analyzing trace with hash 484944463, now seen corresponding path program 2 times [2022-12-05 20:25:19,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:19,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235764651] [2022-12-05 20:25:19,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:19,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:25:19,706 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-05 20:25:19,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:25:19,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235764651] [2022-12-05 20:25:19,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235764651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:25:19,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:25:19,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:25:19,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246610513] [2022-12-05 20:25:19,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:25:19,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:25:19,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:25:19,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:25:19,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:25:19,707 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2022-12-05 20:25:19,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 121 transitions, 2419 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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-05 20:25:19,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:25:19,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2022-12-05 20:25:19,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:20,090 INFO L130 PetriNetUnfolder]: 1328/2558 cut-off events. [2022-12-05 20:25:20,090 INFO L131 PetriNetUnfolder]: For 55090/55351 co-relation queries the response was YES. [2022-12-05 20:25:20,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20217 conditions, 2558 events. 1328/2558 cut-off events. For 55090/55351 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 17198 event pairs, 90 based on Foata normal form. 269/2790 useless extension candidates. Maximal degree in co-relation 20168. Up to 796 conditions per place. [2022-12-05 20:25:20,104 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 32 selfloop transitions, 17 changer transitions 177/231 dead transitions. [2022-12-05 20:25:20,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 231 transitions, 5382 flow [2022-12-05 20:25:20,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:25:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:25:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-12-05 20:25:20,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42578125 [2022-12-05 20:25:20,105 INFO L175 Difference]: Start difference. First operand has 130 places, 121 transitions, 2419 flow. Second operand 8 states and 109 transitions. [2022-12-05 20:25:20,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 231 transitions, 5382 flow [2022-12-05 20:25:20,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 231 transitions, 4875 flow, removed 209 selfloop flow, removed 13 redundant places. [2022-12-05 20:25:20,200 INFO L231 Difference]: Finished difference. Result has 123 places, 41 transitions, 511 flow [2022-12-05 20:25:20,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2119, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=511, PETRI_PLACES=123, PETRI_TRANSITIONS=41} [2022-12-05 20:25:20,201 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 79 predicate places. [2022-12-05 20:25:20,201 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 41 transitions, 511 flow [2022-12-05 20:25:20,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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-05 20:25:20,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:20,201 INFO L213 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] [2022-12-05 20:25:20,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-05 20:25:20,201 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:25:20,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:20,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1727602990, now seen corresponding path program 1 times [2022-12-05 20:25:20,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:20,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336956045] [2022-12-05 20:25:20,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:20,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:25:20,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:25:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:25:20,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:25:20,262 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:25:20,262 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 20:25:20,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 20:25:20,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 20:25:20,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 20:25:20,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 20:25:20,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 20:25:20,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 20:25:20,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-05 20:25:20,265 INFO L458 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:25:20,269 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:25:20,269 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:25:20,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:25:20 BasicIcfg [2022-12-05 20:25:20,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:25:20,314 INFO L158 Benchmark]: Toolchain (without parser) took 84593.07ms. Allocated memory was 185.6MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 160.1MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-05 20:25:20,314 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:25:20,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.74ms. Allocated memory is still 185.6MB. Free memory was 160.1MB in the beginning and 132.6MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 20:25:20,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.22ms. Allocated memory is still 185.6MB. Free memory was 132.6MB in the beginning and 129.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:25:20,315 INFO L158 Benchmark]: Boogie Preprocessor took 32.12ms. Allocated memory is still 185.6MB. Free memory was 129.5MB in the beginning and 127.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:25:20,315 INFO L158 Benchmark]: RCFGBuilder took 486.50ms. Allocated memory is still 185.6MB. Free memory was 127.9MB in the beginning and 94.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-05 20:25:20,315 INFO L158 Benchmark]: TraceAbstraction took 83529.57ms. Allocated memory was 185.6MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 93.3MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-05 20:25:20,316 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.13ms. Allocated memory is still 185.6MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 482.74ms. Allocated memory is still 185.6MB. Free memory was 160.1MB in the beginning and 132.6MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.22ms. Allocated memory is still 185.6MB. Free memory was 132.6MB in the beginning and 129.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.12ms. Allocated memory is still 185.6MB. Free memory was 129.5MB in the beginning and 127.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 486.50ms. Allocated memory is still 185.6MB. Free memory was 127.9MB in the beginning and 94.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 83529.57ms. Allocated memory was 185.6MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 93.3MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 136 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 32 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2265, independent: 2202, independent conditional: 2202, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2265, independent: 2202, independent conditional: 0, independent unconditional: 2202, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2265, independent: 2202, independent conditional: 0, independent unconditional: 2202, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2265, independent: 2202, independent conditional: 0, independent unconditional: 2202, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1857, independent: 1811, independent conditional: 0, independent unconditional: 1811, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1857, independent: 1782, independent conditional: 0, independent unconditional: 1782, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 241, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2265, independent: 391, independent conditional: 0, independent unconditional: 391, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1857, unknown conditional: 0, unknown unconditional: 1857] , Statistics on independence cache: Total cache size (in pairs): 2730, Positive cache size: 2684, Positive conditional cache size: 0, Positive unconditional cache size: 2684, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1253, ((void *)0), P0, ((void *)0))=-2, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1254, ((void *)0), P1, ((void *)0))=-1, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1255, ((void *)0), P2, ((void *)0))=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1256, ((void *)0), P3, ((void *)0))=1, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 [L813] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: 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: 845]: 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: 847]: 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: 851]: 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: 849]: 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 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 83.4s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 71.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1223 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1223 mSDsluCounter, 385 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 255 mSDsCounter, 208 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3395 IncrementalHoareTripleChecker+Invalid, 3603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 208 mSolverCounterUnsat, 130 mSDtfsCounter, 3395 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6719occurred in iteration=15, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 4105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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-05 20:25:20,332 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...