/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/pthread-wmm/mix039_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 13:28:43,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 13:28:43,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 13:28:43,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 13:28:43,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 13:28:43,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 13:28:43,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 13:28:43,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 13:28:43,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 13:28:43,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 13:28:43,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 13:28:43,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 13:28:43,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 13:28:43,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 13:28:43,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 13:28:43,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 13:28:43,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 13:28:43,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 13:28:43,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 13:28:43,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 13:28:43,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 13:28:43,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 13:28:43,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 13:28:43,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 13:28:43,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 13:28:43,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 13:28:43,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 13:28:43,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 13:28:43,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 13:28:43,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 13:28:43,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 13:28:43,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 13:28:43,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 13:28:43,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 13:28:43,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 13:28:43,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 13:28:43,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 13:28:43,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 13:28:43,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 13:28:43,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 13:28:43,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 13:28:43,993 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 13:28:44,042 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 13:28:44,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 13:28:44,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 13:28:44,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 13:28:44,047 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 13:28:44,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 13:28:44,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 13:28:44,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 13:28:44,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 13:28:44,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 13:28:44,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 13:28:44,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 13:28:44,050 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 13:28:44,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 13:28:44,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 13:28:44,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 13:28:44,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 13:28:44,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 13:28:44,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 13:28:44,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 13:28:44,052 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 13:28:44,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 13:28:44,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 13:28:44,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 13:28:44,052 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 13:28:44,053 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-bitabs/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 [2020-12-23 13:28:44,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 13:28:44,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 13:28:44,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 13:28:44,537 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 13:28:44,537 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 13:28:44,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix039_power.oepc.i [2020-12-23 13:28:44,628 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0b7c36b7b/ab8872a3d79a4d0b9383cb8c57c278b4/FLAGf08350a27 [2020-12-23 13:28:45,430 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 13:28:45,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix039_power.oepc.i [2020-12-23 13:28:45,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0b7c36b7b/ab8872a3d79a4d0b9383cb8c57c278b4/FLAGf08350a27 [2020-12-23 13:28:45,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0b7c36b7b/ab8872a3d79a4d0b9383cb8c57c278b4 [2020-12-23 13:28:45,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 13:28:45,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 13:28:45,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 13:28:45,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 13:28:45,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 13:28:45,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:28:45" (1/1) ... [2020-12-23 13:28:45,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed84099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:28:45, skipping insertion in model container [2020-12-23 13:28:45,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:28:45" (1/1) ... [2020-12-23 13:28:45,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 13:28:45,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 13:28:46,083 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix039_power.oepc.i[951,964] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2020-12-23 13:28:46,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:28:46,410 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 13:28:46,427 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix039_power.oepc.i[951,964] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2020-12-23 13:28:46,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:28:46,631 INFO L208 MainTranslator]: Completed translation [2020-12-23 13:28:46,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:28:46 WrapperNode [2020-12-23 13:28:46,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 13:28:46,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 13:28:46,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 13:28:46,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 13:28:46,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:28:46" (1/1) ... [2020-12-23 13:28:46,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:28:46" (1/1) ... [2020-12-23 13:28:46,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 13:28:46,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 13:28:46,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 13:28:46,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 13:28:46,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:28:46" (1/1) ... [2020-12-23 13:28:46,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:28:46" (1/1) ... [2020-12-23 13:28:46,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:28:46" (1/1) ... [2020-12-23 13:28:46,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:28:46" (1/1) ... [2020-12-23 13:28:46,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:28:46" (1/1) ... [2020-12-23 13:28:46,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:28:46" (1/1) ... [2020-12-23 13:28:46,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:28:46" (1/1) ... [2020-12-23 13:28:46,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 13:28:46,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 13:28:46,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 13:28:46,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 13:28:46,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:28:46" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 13:28:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 13:28:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-23 13:28:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 13:28:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 13:28:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-23 13:28:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-23 13:28:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-23 13:28:46,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-23 13:28:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-23 13:28:46,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-23 13:28:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-23 13:28:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-23 13:28:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 13:28:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-23 13:28:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 13:28:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 13:28:46,861 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-23 13:28:49,271 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 13:28:49,272 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-23 13:28:49,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:28:49 BoogieIcfgContainer [2020-12-23 13:28:49,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 13:28:49,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 13:28:49,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 13:28:49,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 13:28:49,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:28:45" (1/3) ... [2020-12-23 13:28:49,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6b2747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:28:49, skipping insertion in model container [2020-12-23 13:28:49,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:28:46" (2/3) ... [2020-12-23 13:28:49,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6b2747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:28:49, skipping insertion in model container [2020-12-23 13:28:49,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:28:49" (3/3) ... [2020-12-23 13:28:49,284 INFO L111 eAbstractionObserver]: Analyzing ICFG mix039_power.oepc.i [2020-12-23 13:28:49,293 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-23 13:28:49,293 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 13:28:49,299 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-23 13:28:49,300 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-23 13:28:49,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,342 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,342 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,344 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,344 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,350 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,350 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,350 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,351 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,355 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,356 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,356 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,356 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,361 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,361 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,362 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,362 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,386 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,386 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,395 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,395 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,395 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,398 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,404 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,404 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:28:49,406 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-23 13:28:49,427 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-23 13:28:49,451 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 13:28:49,451 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 13:28:49,452 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 13:28:49,452 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 13:28:49,452 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 13:28:49,452 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 13:28:49,452 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 13:28:49,452 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 13:28:49,467 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-23 13:28:49,470 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 120 transitions, 260 flow [2020-12-23 13:28:49,473 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 120 transitions, 260 flow [2020-12-23 13:28:49,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2020-12-23 13:28:49,578 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2020-12-23 13:28:49,578 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-23 13:28:49,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-12-23 13:28:49,592 INFO L116 LiptonReduction]: Number of co-enabled transitions 2876 [2020-12-23 13:28:49,740 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:49,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:49,743 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:49,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:49,752 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:49,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:49,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:49,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:49,833 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:49,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:49,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:49,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:49,845 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:49,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:49,851 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:49,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:49,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:49,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:49,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:49,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:49,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:49,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:50,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:50,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:50,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:50,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:50,033 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:50,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:50,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:50,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:50,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:50,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:50,421 WARN L197 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-23 13:28:51,100 WARN L197 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2020-12-23 13:28:51,319 WARN L197 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-23 13:28:51,456 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:51,458 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:51,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:51,465 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:51,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:51,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:51,503 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:51,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:51,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:51,667 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:51,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:51,673 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:51,698 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:51,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:51,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:51,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:51,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:52,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:52,291 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:52,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:52,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:52,320 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:52,322 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:52,324 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:52,327 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:52,717 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:52,718 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:52,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:52,723 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:52,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:52,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:52,751 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:52,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:52,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:53,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,038 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:53,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:53,062 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:53,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:53,141 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,141 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,142 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,142 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,144 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:53,147 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:53,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,170 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,173 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:53,175 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:53,239 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:53,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:53,267 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,268 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,271 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:53,273 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:53,372 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:53,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 13:28:53,375 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:53,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,440 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:53,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:53,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:28:53,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:53,447 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:28:53,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:53,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:28:53,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:53,451 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:53,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:53,454 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:53,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:53,455 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:53,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:53,756 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-23 13:28:53,881 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-23 13:28:54,103 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-12-23 13:28:54,323 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-12-23 13:28:54,740 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:54,741 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:54,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:54,751 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:54,771 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:54,773 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:54,775 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:54,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:54,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:54,822 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:54,824 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:54,826 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:54,851 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:54,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:54,854 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:54,857 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:54,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:55,054 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:55,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:28:55,057 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:55,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:55,094 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,094 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,109 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:28:55,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:55,110 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:28:55,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:55,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:28:55,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:55,114 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:55,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:55,116 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:55,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:55,117 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:55,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:55,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-23 13:28:55,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:55,447 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:55,479 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,483 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:55,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:55,659 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,661 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:28:55,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:55,662 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:28:55,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:55,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:28:55,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:55,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:55,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:55,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:55,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:55,672 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:55,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:55,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:55,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:28:55,751 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:55,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:55,806 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,807 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,810 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:55,812 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:55,836 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,840 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:55,843 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:55,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:55,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:55,919 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,920 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:55,922 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:55,924 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:55,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,009 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,009 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,010 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,014 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,035 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,037 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:56,039 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:56,201 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,201 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,202 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,204 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,204 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:56,206 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:56,223 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,280 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:56,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 13:28:56,282 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:56,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,321 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,331 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:28:56,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:56,332 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:28:56,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:56,334 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:28:56,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:56,335 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:56,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,336 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:56,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,338 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:56,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,374 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,375 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,377 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,379 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,397 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,398 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,400 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:56,402 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:56,473 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,474 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,475 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:56,477 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:56,495 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,497 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,558 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,561 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:56,563 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:56,579 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,580 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:56,582 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:56,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:56,806 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-12-23 13:28:57,048 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:57,051 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:28:57,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:57,052 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:28:57,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:57,054 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:28:57,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:28:57,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:57,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:57,057 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:57,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:57,059 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:57,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:57,110 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:57,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 13:28:57,113 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:28:57,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:57,147 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:57,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:57,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:57,152 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:57,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:57,170 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:57,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:57,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:57,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:57,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:57,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:57,303 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:28:57,322 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:57,323 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:28:57,325 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:57,326 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:28:57,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:28:58,350 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-12-23 13:28:58,548 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-12-23 13:28:58,817 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-12-23 13:28:58,976 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-12-23 13:28:59,111 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-12-23 13:28:59,244 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-12-23 13:28:59,814 WARN L197 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-12-23 13:29:00,101 WARN L197 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-12-23 13:29:00,752 WARN L197 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-12-23 13:29:01,031 WARN L197 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-12-23 13:29:01,039 INFO L131 LiptonReduction]: Checked pairs total: 8594 [2020-12-23 13:29:01,040 INFO L133 LiptonReduction]: Total number of compositions: 96 [2020-12-23 13:29:01,046 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2020-12-23 13:29:01,463 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5774 states. [2020-12-23 13:29:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5774 states. [2020-12-23 13:29:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-23 13:29:01,471 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:29:01,472 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-23 13:29:01,472 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:29:01,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:29:01,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1220216, now seen corresponding path program 1 times [2020-12-23 13:29:01,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:29:01,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362431229] [2020-12-23 13:29:01,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:29:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:29:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:29:01,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362431229] [2020-12-23 13:29:01,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:29:01,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-23 13:29:01,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422824094] [2020-12-23 13:29:01,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 13:29:01,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:29:01,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 13:29:01,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:29:01,888 INFO L87 Difference]: Start difference. First operand 5774 states. Second operand 3 states. [2020-12-23 13:29:02,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:29:02,100 INFO L93 Difference]: Finished difference Result 4812 states and 19300 transitions. [2020-12-23 13:29:02,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 13:29:02,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-23 13:29:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:29:02,186 INFO L225 Difference]: With dead ends: 4812 [2020-12-23 13:29:02,186 INFO L226 Difference]: Without dead ends: 4062 [2020-12-23 13:29:02,188 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:29:02,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2020-12-23 13:29:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2020-12-23 13:29:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2020-12-23 13:29:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2020-12-23 13:29:02,567 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 3 [2020-12-23 13:29:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:29:02,568 INFO L481 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2020-12-23 13:29:02,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 13:29:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2020-12-23 13:29:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 13:29:02,576 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:29:02,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:29:02,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 13:29:02,577 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:29:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:29:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1210856562, now seen corresponding path program 1 times [2020-12-23 13:29:02,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:29:02,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441882935] [2020-12-23 13:29:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:29:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:29:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:29:02,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441882935] [2020-12-23 13:29:02,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:29:02,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 13:29:02,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784375388] [2020-12-23 13:29:02,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:29:02,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:29:02,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:29:02,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:29:02,782 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand 4 states. [2020-12-23 13:29:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:29:02,965 INFO L93 Difference]: Finished difference Result 7556 states and 28724 transitions. [2020-12-23 13:29:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:29:02,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-23 13:29:02,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:29:03,033 INFO L225 Difference]: With dead ends: 7556 [2020-12-23 13:29:03,033 INFO L226 Difference]: Without dead ends: 6125 [2020-12-23 13:29:03,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:29:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6125 states. [2020-12-23 13:29:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6125 to 5249. [2020-12-23 13:29:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5249 states. [2020-12-23 13:29:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5249 states to 5249 states and 20459 transitions. [2020-12-23 13:29:03,342 INFO L78 Accepts]: Start accepts. Automaton has 5249 states and 20459 transitions. Word has length 12 [2020-12-23 13:29:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:29:03,343 INFO L481 AbstractCegarLoop]: Abstraction has 5249 states and 20459 transitions. [2020-12-23 13:29:03,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:29:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 5249 states and 20459 transitions. [2020-12-23 13:29:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 13:29:03,352 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:29:03,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:29:03,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 13:29:03,353 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:29:03,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:29:03,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1118187933, now seen corresponding path program 1 times [2020-12-23 13:29:03,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:29:03,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612084811] [2020-12-23 13:29:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:29:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:29:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:29:03,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612084811] [2020-12-23 13:29:03,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:29:03,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:29:03,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831198072] [2020-12-23 13:29:03,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:29:03,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:29:03,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:29:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:29:03,494 INFO L87 Difference]: Start difference. First operand 5249 states and 20459 transitions. Second operand 5 states. [2020-12-23 13:29:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:29:03,754 INFO L93 Difference]: Finished difference Result 6355 states and 23821 transitions. [2020-12-23 13:29:03,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:29:03,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-23 13:29:03,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:29:03,823 INFO L225 Difference]: With dead ends: 6355 [2020-12-23 13:29:03,823 INFO L226 Difference]: Without dead ends: 5389 [2020-12-23 13:29:03,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:29:03,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5389 states. [2020-12-23 13:29:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5389 to 4219. [2020-12-23 13:29:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4219 states. [2020-12-23 13:29:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4219 states to 4219 states and 16349 transitions. [2020-12-23 13:29:04,036 INFO L78 Accepts]: Start accepts. Automaton has 4219 states and 16349 transitions. Word has length 13 [2020-12-23 13:29:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:29:04,037 INFO L481 AbstractCegarLoop]: Abstraction has 4219 states and 16349 transitions. [2020-12-23 13:29:04,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:29:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 4219 states and 16349 transitions. [2020-12-23 13:29:04,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-23 13:29:04,041 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:29:04,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:29:04,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 13:29:04,041 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:29:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:29:04,042 INFO L82 PathProgramCache]: Analyzing trace with hash -305047728, now seen corresponding path program 1 times [2020-12-23 13:29:04,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:29:04,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632986324] [2020-12-23 13:29:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:29:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:29:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:29:04,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632986324] [2020-12-23 13:29:04,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:29:04,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:29:04,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006109480] [2020-12-23 13:29:04,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:29:04,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:29:04,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:29:04,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:29:04,178 INFO L87 Difference]: Start difference. First operand 4219 states and 16349 transitions. Second operand 5 states. [2020-12-23 13:29:04,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:29:04,348 INFO L93 Difference]: Finished difference Result 5983 states and 22249 transitions. [2020-12-23 13:29:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:29:04,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-23 13:29:04,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:29:04,378 INFO L225 Difference]: With dead ends: 5983 [2020-12-23 13:29:04,378 INFO L226 Difference]: Without dead ends: 5189 [2020-12-23 13:29:04,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:29:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2020-12-23 13:29:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 4139. [2020-12-23 13:29:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4139 states. [2020-12-23 13:29:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 15985 transitions. [2020-12-23 13:29:04,601 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 15985 transitions. Word has length 14 [2020-12-23 13:29:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:29:04,602 INFO L481 AbstractCegarLoop]: Abstraction has 4139 states and 15985 transitions. [2020-12-23 13:29:04,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:29:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 15985 transitions. [2020-12-23 13:29:04,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 13:29:04,607 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:29:04,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:29:04,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 13:29:04,607 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:29:04,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:29:04,608 INFO L82 PathProgramCache]: Analyzing trace with hash -838846207, now seen corresponding path program 1 times [2020-12-23 13:29:04,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:29:04,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074850185] [2020-12-23 13:29:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:29:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:29:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:29:04,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074850185] [2020-12-23 13:29:04,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:29:04,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:29:04,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451276435] [2020-12-23 13:29:04,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:29:04,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:29:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:29:04,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:29:04,745 INFO L87 Difference]: Start difference. First operand 4139 states and 15985 transitions. Second operand 4 states. [2020-12-23 13:29:04,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:29:04,877 INFO L93 Difference]: Finished difference Result 3972 states and 13808 transitions. [2020-12-23 13:29:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:29:04,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-23 13:29:04,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:29:04,891 INFO L225 Difference]: With dead ends: 3972 [2020-12-23 13:29:04,891 INFO L226 Difference]: Without dead ends: 3003 [2020-12-23 13:29:04,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:29:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2020-12-23 13:29:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 3003. [2020-12-23 13:29:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3003 states. [2020-12-23 13:29:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 10321 transitions. [2020-12-23 13:29:04,999 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 10321 transitions. Word has length 15 [2020-12-23 13:29:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:29:04,999 INFO L481 AbstractCegarLoop]: Abstraction has 3003 states and 10321 transitions. [2020-12-23 13:29:04,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:29:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 10321 transitions. [2020-12-23 13:29:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 13:29:05,004 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:29:05,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:29:05,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 13:29:05,005 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:29:05,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:29:05,005 INFO L82 PathProgramCache]: Analyzing trace with hash 4357385, now seen corresponding path program 1 times [2020-12-23 13:29:05,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:29:05,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420943910] [2020-12-23 13:29:05,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:29:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:29:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:29:05,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420943910] [2020-12-23 13:29:05,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:29:05,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:29:05,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040435555] [2020-12-23 13:29:05,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:29:05,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:29:05,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:29:05,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:29:05,088 INFO L87 Difference]: Start difference. First operand 3003 states and 10321 transitions. Second operand 4 states. [2020-12-23 13:29:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:29:05,146 INFO L93 Difference]: Finished difference Result 4503 states and 15096 transitions. [2020-12-23 13:29:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:29:05,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-23 13:29:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:29:05,159 INFO L225 Difference]: With dead ends: 4503 [2020-12-23 13:29:05,159 INFO L226 Difference]: Without dead ends: 2830 [2020-12-23 13:29:05,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:29:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2020-12-23 13:29:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2434. [2020-12-23 13:29:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2020-12-23 13:29:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 8135 transitions. [2020-12-23 13:29:05,249 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 8135 transitions. Word has length 18 [2020-12-23 13:29:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:29:05,250 INFO L481 AbstractCegarLoop]: Abstraction has 2434 states and 8135 transitions. [2020-12-23 13:29:05,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:29:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 8135 transitions. [2020-12-23 13:29:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 13:29:05,257 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:29:05,258 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:29:05,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 13:29:05,258 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:29:05,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:29:05,258 INFO L82 PathProgramCache]: Analyzing trace with hash 444465675, now seen corresponding path program 1 times [2020-12-23 13:29:05,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:29:05,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367602563] [2020-12-23 13:29:05,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:29:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:29:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:29:05,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367602563] [2020-12-23 13:29:05,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:29:05,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:29:05,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387416871] [2020-12-23 13:29:05,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:29:05,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:29:05,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:29:05,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:29:05,383 INFO L87 Difference]: Start difference. First operand 2434 states and 8135 transitions. Second operand 5 states. [2020-12-23 13:29:05,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:29:05,442 INFO L93 Difference]: Finished difference Result 1920 states and 5842 transitions. [2020-12-23 13:29:05,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:29:05,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-12-23 13:29:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:29:05,449 INFO L225 Difference]: With dead ends: 1920 [2020-12-23 13:29:05,449 INFO L226 Difference]: Without dead ends: 1490 [2020-12-23 13:29:05,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:29:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2020-12-23 13:29:05,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2020-12-23 13:29:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2020-12-23 13:29:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 4453 transitions. [2020-12-23 13:29:05,497 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 4453 transitions. Word has length 18 [2020-12-23 13:29:05,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:29:05,497 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 4453 transitions. [2020-12-23 13:29:05,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:29:05,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 4453 transitions. [2020-12-23 13:29:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-23 13:29:05,501 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:29:05,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:29:05,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 13:29:05,502 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:29:05,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:29:05,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1700349900, now seen corresponding path program 1 times [2020-12-23 13:29:05,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:29:05,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134567671] [2020-12-23 13:29:05,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:29:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:29:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:29:05,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134567671] [2020-12-23 13:29:05,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:29:05,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 13:29:05,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072331329] [2020-12-23 13:29:05,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 13:29:05,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:29:05,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 13:29:05,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:29:05,618 INFO L87 Difference]: Start difference. First operand 1490 states and 4453 transitions. Second operand 6 states. [2020-12-23 13:29:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:29:05,690 INFO L93 Difference]: Finished difference Result 1254 states and 3719 transitions. [2020-12-23 13:29:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:29:05,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-23 13:29:05,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:29:05,695 INFO L225 Difference]: With dead ends: 1254 [2020-12-23 13:29:05,695 INFO L226 Difference]: Without dead ends: 1128 [2020-12-23 13:29:05,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:29:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2020-12-23 13:29:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2020-12-23 13:29:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2020-12-23 13:29:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 3391 transitions. [2020-12-23 13:29:05,729 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 3391 transitions. Word has length 21 [2020-12-23 13:29:05,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:29:05,730 INFO L481 AbstractCegarLoop]: Abstraction has 1128 states and 3391 transitions. [2020-12-23 13:29:05,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 13:29:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 3391 transitions. [2020-12-23 13:29:05,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:29:05,734 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:29:05,734 INFO L422 BasicCegarLoop]: 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] [2020-12-23 13:29:05,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 13:29:05,734 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:29:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:29:05,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1270128549, now seen corresponding path program 1 times [2020-12-23 13:29:05,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:29:05,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067269682] [2020-12-23 13:29:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:29:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:29:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:29:05,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067269682] [2020-12-23 13:29:05,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:29:05,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 13:29:05,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215479546] [2020-12-23 13:29:05,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 13:29:05,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:29:05,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 13:29:05,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:29:05,924 INFO L87 Difference]: Start difference. First operand 1128 states and 3391 transitions. Second operand 7 states. [2020-12-23 13:29:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:29:06,035 INFO L93 Difference]: Finished difference Result 1084 states and 3302 transitions. [2020-12-23 13:29:06,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 13:29:06,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-12-23 13:29:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:29:06,039 INFO L225 Difference]: With dead ends: 1084 [2020-12-23 13:29:06,040 INFO L226 Difference]: Without dead ends: 746 [2020-12-23 13:29:06,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-23 13:29:06,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2020-12-23 13:29:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2020-12-23 13:29:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2020-12-23 13:29:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 2253 transitions. [2020-12-23 13:29:06,064 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 2253 transitions. Word has length 25 [2020-12-23 13:29:06,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:29:06,065 INFO L481 AbstractCegarLoop]: Abstraction has 746 states and 2253 transitions. [2020-12-23 13:29:06,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 13:29:06,065 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 2253 transitions. [2020-12-23 13:29:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 13:29:06,068 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:29:06,068 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:29:06,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 13:29:06,068 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:29:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:29:06,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1637532631, now seen corresponding path program 1 times [2020-12-23 13:29:06,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:29:06,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337804329] [2020-12-23 13:29:06,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:29:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:29:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:29:06,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337804329] [2020-12-23 13:29:06,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:29:06,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:29:06,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072791564] [2020-12-23 13:29:06,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:29:06,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:29:06,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:29:06,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:29:06,184 INFO L87 Difference]: Start difference. First operand 746 states and 2253 transitions. Second operand 5 states. [2020-12-23 13:29:06,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:29:06,224 INFO L93 Difference]: Finished difference Result 1157 states and 3458 transitions. [2020-12-23 13:29:06,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:29:06,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-12-23 13:29:06,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:29:06,228 INFO L225 Difference]: With dead ends: 1157 [2020-12-23 13:29:06,229 INFO L226 Difference]: Without dead ends: 474 [2020-12-23 13:29:06,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:29:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-12-23 13:29:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2020-12-23 13:29:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2020-12-23 13:29:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1341 transitions. [2020-12-23 13:29:06,244 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1341 transitions. Word has length 29 [2020-12-23 13:29:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:29:06,245 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 1341 transitions. [2020-12-23 13:29:06,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:29:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1341 transitions. [2020-12-23 13:29:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 13:29:06,247 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:29:06,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:29:06,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 13:29:06,247 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:29:06,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:29:06,248 INFO L82 PathProgramCache]: Analyzing trace with hash 797600673, now seen corresponding path program 2 times [2020-12-23 13:29:06,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:29:06,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207326255] [2020-12-23 13:29:06,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:29:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:29:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:29:06,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207326255] [2020-12-23 13:29:06,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:29:06,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:29:06,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297555633] [2020-12-23 13:29:06,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:29:06,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:29:06,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:29:06,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:29:06,369 INFO L87 Difference]: Start difference. First operand 474 states and 1341 transitions. Second operand 5 states. [2020-12-23 13:29:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:29:06,402 INFO L93 Difference]: Finished difference Result 612 states and 1722 transitions. [2020-12-23 13:29:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:29:06,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-12-23 13:29:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:29:06,404 INFO L225 Difference]: With dead ends: 612 [2020-12-23 13:29:06,405 INFO L226 Difference]: Without dead ends: 344 [2020-12-23 13:29:06,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:29:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-12-23 13:29:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2020-12-23 13:29:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-12-23 13:29:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 941 transitions. [2020-12-23 13:29:06,415 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 941 transitions. Word has length 29 [2020-12-23 13:29:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:29:06,416 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 941 transitions. [2020-12-23 13:29:06,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:29:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 941 transitions. [2020-12-23 13:29:06,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 13:29:06,417 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:29:06,418 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:29:06,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 13:29:06,418 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:29:06,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:29:06,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2016220927, now seen corresponding path program 3 times [2020-12-23 13:29:06,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:29:06,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849260744] [2020-12-23 13:29:06,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:29:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:29:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:29:06,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849260744] [2020-12-23 13:29:06,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:29:06,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 13:29:06,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622749257] [2020-12-23 13:29:06,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 13:29:06,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:29:06,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 13:29:06,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 13:29:06,906 INFO L87 Difference]: Start difference. First operand 344 states and 941 transitions. Second operand 9 states. [2020-12-23 13:29:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:29:07,162 INFO L93 Difference]: Finished difference Result 401 states and 1079 transitions. [2020-12-23 13:29:07,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:29:07,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-12-23 13:29:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:29:07,163 INFO L225 Difference]: With dead ends: 401 [2020-12-23 13:29:07,164 INFO L226 Difference]: Without dead ends: 182 [2020-12-23 13:29:07,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-12-23 13:29:07,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-12-23 13:29:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2020-12-23 13:29:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-12-23 13:29:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 425 transitions. [2020-12-23 13:29:07,170 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 425 transitions. Word has length 29 [2020-12-23 13:29:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:29:07,170 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 425 transitions. [2020-12-23 13:29:07,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 13:29:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 425 transitions. [2020-12-23 13:29:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 13:29:07,171 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:29:07,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:29:07,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 13:29:07,172 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:29:07,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:29:07,173 INFO L82 PathProgramCache]: Analyzing trace with hash 2069417095, now seen corresponding path program 4 times [2020-12-23 13:29:07,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:29:07,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968066732] [2020-12-23 13:29:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:29:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 13:29:07,251 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 13:29:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 13:29:07,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 13:29:07,365 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 13:29:07,365 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 13:29:07,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 13:29:07,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:29:07 BasicIcfg [2020-12-23 13:29:07,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 13:29:07,497 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 13:29:07,497 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 13:29:07,497 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 13:29:07,497 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:28:49" (3/4) ... [2020-12-23 13:29:07,500 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 13:29:07,647 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix039_power.oepc.i-witness.graphml [2020-12-23 13:29:07,648 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 13:29:07,649 INFO L168 Benchmark]: Toolchain (without parser) took 21948.04 ms. Allocated memory was 164.6 MB in the beginning and 579.9 MB in the end (delta: 415.2 MB). Free memory was 137.2 MB in the beginning and 254.0 MB in the end (delta: -116.8 MB). Peak memory consumption was 299.2 MB. Max. memory is 8.0 GB. [2020-12-23 13:29:07,649 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 164.6 MB. Free memory is still 135.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 13:29:07,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 928.72 ms. Allocated memory is still 164.6 MB. Free memory was 137.1 MB in the beginning and 136.1 MB in the end (delta: 981.6 kB). Peak memory consumption was 32.3 MB. Max. memory is 8.0 GB. [2020-12-23 13:29:07,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.21 ms. Allocated memory is still 164.6 MB. Free memory was 135.6 MB in the beginning and 133.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:29:07,650 INFO L168 Benchmark]: Boogie Preprocessor took 46.37 ms. Allocated memory is still 164.6 MB. Free memory was 133.5 MB in the beginning and 130.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:29:07,651 INFO L168 Benchmark]: RCFGBuilder took 2528.90 ms. Allocated memory was 164.6 MB in the beginning and 211.8 MB in the end (delta: 47.2 MB). Free memory was 130.9 MB in the beginning and 104.3 MB in the end (delta: 26.5 MB). Peak memory consumption was 92.6 MB. Max. memory is 8.0 GB. [2020-12-23 13:29:07,651 INFO L168 Benchmark]: TraceAbstraction took 18219.64 ms. Allocated memory was 211.8 MB in the beginning and 579.9 MB in the end (delta: 368.1 MB). Free memory was 103.8 MB in the beginning and 280.2 MB in the end (delta: -176.4 MB). Peak memory consumption was 191.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:29:07,652 INFO L168 Benchmark]: Witness Printer took 151.01 ms. Allocated memory is still 579.9 MB. Free memory was 280.2 MB in the beginning and 254.0 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. [2020-12-23 13:29:07,655 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.19 ms. Allocated memory is still 164.6 MB. Free memory is still 135.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 928.72 ms. Allocated memory is still 164.6 MB. Free memory was 137.1 MB in the beginning and 136.1 MB in the end (delta: 981.6 kB). Peak memory consumption was 32.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 65.21 ms. Allocated memory is still 164.6 MB. Free memory was 135.6 MB in the beginning and 133.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 46.37 ms. Allocated memory is still 164.6 MB. Free memory was 133.5 MB in the beginning and 130.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2528.90 ms. Allocated memory was 164.6 MB in the beginning and 211.8 MB in the end (delta: 47.2 MB). Free memory was 130.9 MB in the beginning and 104.3 MB in the end (delta: 26.5 MB). Peak memory consumption was 92.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18219.64 ms. Allocated memory was 211.8 MB in the beginning and 579.9 MB in the end (delta: 368.1 MB). Free memory was 103.8 MB in the beginning and 280.2 MB in the end (delta: -176.4 MB). Peak memory consumption was 191.1 MB. Max. memory is 8.0 GB. * Witness Printer took 151.01 ms. Allocated memory is still 579.9 MB. Free memory was 280.2 MB in the beginning and 254.0 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2013 VarBasedMoverChecksPositive, 111 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 71 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.1s, 278 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.5s, 131 PlacesBefore, 48 PlacesAfterwards, 120 TransitionsBefore, 36 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 8594 MoverChecksTotal - 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_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1027; [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1028; [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L804] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L824] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.0s, HoareTripleCheckerStatistics: 545 SDtfs, 686 SDslu, 1153 SDs, 0 SdLazy, 320 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5774occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 3492 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 25569 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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! Received shutdown request...