/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/mix055_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 13:32:47,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 13:32:47,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 13:32:47,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 13:32:47,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 13:32:47,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 13:32:47,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 13:32:47,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 13:32:47,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 13:32:47,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 13:32:47,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 13:32:47,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 13:32:47,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 13:32:47,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 13:32:47,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 13:32:47,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 13:32:47,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 13:32:47,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 13:32:47,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 13:32:47,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 13:32:47,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 13:32:47,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 13:32:47,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 13:32:47,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 13:32:47,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 13:32:47,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 13:32:47,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 13:32:47,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 13:32:47,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 13:32:47,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 13:32:47,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 13:32:47,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 13:32:47,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 13:32:47,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 13:32:47,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 13:32:47,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 13:32:47,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 13:32:47,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 13:32:47,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 13:32:47,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 13:32:47,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 13:32:47,279 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:32:47,325 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 13:32:47,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 13:32:47,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 13:32:47,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 13:32:47,327 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 13:32:47,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 13:32:47,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 13:32:47,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 13:32:47,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 13:32:47,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 13:32:47,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 13:32:47,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 13:32:47,329 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 13:32:47,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 13:32:47,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 13:32:47,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 13:32:47,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 13:32:47,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 13:32:47,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 13:32:47,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 13:32:47,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 13:32:47,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 13:32:47,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 13:32:47,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 13:32:47,331 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 13:32:47,331 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:32:47,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 13:32:47,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 13:32:47,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 13:32:47,724 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 13:32:47,725 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 13:32:47,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix055_rmo.oepc.i [2020-12-23 13:32:47,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a693d5d38/42c27105968c4e6b828c6b083a28f97d/FLAG0bd490230 [2020-12-23 13:32:48,625 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 13:32:48,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix055_rmo.oepc.i [2020-12-23 13:32:48,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a693d5d38/42c27105968c4e6b828c6b083a28f97d/FLAG0bd490230 [2020-12-23 13:32:48,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a693d5d38/42c27105968c4e6b828c6b083a28f97d [2020-12-23 13:32:48,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 13:32:48,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 13:32:48,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 13:32:48,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 13:32:48,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 13:32:48,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:32:48" (1/1) ... [2020-12-23 13:32:48,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5b3967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:32:48, skipping insertion in model container [2020-12-23 13:32:48,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:32:48" (1/1) ... [2020-12-23 13:32:48,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 13:32:48,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 13:32:49,133 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/mix055_rmo.oepc.i[949,962] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$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[~__unbuffered_p1_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$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[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$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[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$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[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2020-12-23 13:32:49,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:32:49,455 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 13:32:49,467 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/mix055_rmo.oepc.i[949,962] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$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[~__unbuffered_p1_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$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[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$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[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$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[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2020-12-23 13:32:49,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:32:49,703 INFO L208 MainTranslator]: Completed translation [2020-12-23 13:32:49,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:32:49 WrapperNode [2020-12-23 13:32:49,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 13:32:49,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 13:32:49,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 13:32:49,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 13:32:49,718 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:32:49" (1/1) ... [2020-12-23 13:32:49,764 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:32:49" (1/1) ... [2020-12-23 13:32:49,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 13:32:49,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 13:32:49,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 13:32:49,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 13:32:49,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:32:49" (1/1) ... [2020-12-23 13:32:49,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:32:49" (1/1) ... [2020-12-23 13:32:49,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:32:49" (1/1) ... [2020-12-23 13:32:49,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:32:49" (1/1) ... [2020-12-23 13:32:49,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:32:49" (1/1) ... [2020-12-23 13:32:49,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:32:49" (1/1) ... [2020-12-23 13:32:49,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:32:49" (1/1) ... [2020-12-23 13:32:49,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 13:32:49,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 13:32:49,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 13:32:49,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 13:32:49,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:32:49" (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:32:49,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 13:32:49,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-23 13:32:49,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 13:32:49,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 13:32:49,973 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-23 13:32:49,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-23 13:32:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-23 13:32:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-23 13:32:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-23 13:32:49,976 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-23 13:32:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-23 13:32:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-23 13:32:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 13:32:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-23 13:32:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 13:32:49,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 13:32:49,982 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:32:52,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 13:32:52,601 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-23 13:32:52,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:32:52 BoogieIcfgContainer [2020-12-23 13:32:52,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 13:32:52,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 13:32:52,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 13:32:52,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 13:32:52,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:32:48" (1/3) ... [2020-12-23 13:32:52,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d114fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:32:52, skipping insertion in model container [2020-12-23 13:32:52,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:32:49" (2/3) ... [2020-12-23 13:32:52,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d114fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:32:52, skipping insertion in model container [2020-12-23 13:32:52,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:32:52" (3/3) ... [2020-12-23 13:32:52,613 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_rmo.oepc.i [2020-12-23 13:32:52,621 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-23 13:32:52,621 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 13:32:52,627 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-23 13:32:52,628 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-23 13:32:52,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,675 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,675 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,676 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,676 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,676 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,683 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,683 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,684 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,684 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,688 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,688 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,689 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,689 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,689 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,689 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,689 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,689 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,694 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,694 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,695 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,695 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,754 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,757 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,757 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,760 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,761 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:32:52,768 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-23 13:32:52,787 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-23 13:32:52,809 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 13:32:52,809 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 13:32:52,809 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 13:32:52,809 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 13:32:52,810 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 13:32:52,810 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 13:32:52,810 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 13:32:52,810 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 13:32:52,825 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-23 13:32:52,828 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 250 flow [2020-12-23 13:32:52,831 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 250 flow [2020-12-23 13:32:52,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2020-12-23 13:32:52,888 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2020-12-23 13:32:52,888 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-23 13:32:52,894 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-12-23 13:32:52,898 INFO L116 LiptonReduction]: Number of co-enabled transitions 2672 [2020-12-23 13:32:53,027 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-23 13:32:53,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:53,718 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:53,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:53,720 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:53,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:53,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:53,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:53,730 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:32:53,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:53,769 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:53,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:53,775 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:53,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:53,780 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:53,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:53,789 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:32:53,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:53,897 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:53,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:53,901 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:53,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:53,903 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:32:53,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:53,905 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:53,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:53,909 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:32:53,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:53,913 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:32:53,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:53,915 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:32:53,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:53,989 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:53,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:32:53,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:53,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:54,035 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:54,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:54,037 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:54,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:54,039 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:54,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:54,042 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:32:54,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:54,067 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:54,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:54,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:54,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:54,071 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:54,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:54,074 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:32:54,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:54,392 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-23 13:32:54,497 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-23 13:32:55,022 WARN L197 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-23 13:32:55,229 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-23 13:32:55,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:55,261 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,262 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:55,264 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,264 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:55,267 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:32:55,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:55,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:55,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:55,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:55,301 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:32:55,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:55,334 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:55,336 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:55,338 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:55,341 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:32:55,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:55,365 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:55,366 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:55,369 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:55,372 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:32:55,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:55,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:55,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:55,656 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:55,659 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:32:55,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:55,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:55,684 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:55,686 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:55,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:55,689 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:32:55,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:56,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:56,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:56,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:56,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:56,110 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:56,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:56,113 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:32:56,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:56,138 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:56,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:56,139 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:56,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:56,142 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:56,142 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:56,145 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:32:56,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:56,189 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:56,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:56,191 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:56,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:56,193 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:56,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:56,196 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:32:56,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:56,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:56,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:56,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:56,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:56,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:32:56,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:56,246 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:32:56,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:56,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:56,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:32:56,452 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:56,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:56,507 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:56,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:56,513 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:56,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:56,514 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:32:56,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:56,515 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:56,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:56,519 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:32:56,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:56,521 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:32:56,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:56,522 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:32:56,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:56,752 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-23 13:32:56,859 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-23 13:32:57,049 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-23 13:32:57,268 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-23 13:32:57,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:57,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:57,356 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:57,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:57,358 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:57,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:57,360 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:32:57,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:57,392 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:57,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:57,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:57,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:57,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:57,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:57,398 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:32:57,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:57,799 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-23 13:32:57,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:58,287 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:58,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:58,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:32:58,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:58,297 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:32:58,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:58,320 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:58,321 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:58,324 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:58,326 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:32:58,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:58,752 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:58,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:58,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:58,757 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:32:58,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:58,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:58,778 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:58,780 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:58,782 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:32:58,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:58,990 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:58,991 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:58,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:58,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:58,995 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:32:58,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:59,013 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,014 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,016 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,018 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:32:59,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:59,220 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:32:59,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:59,238 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,239 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,243 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:32:59,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,291 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:59,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 13:32:59,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:59,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,336 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:59,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:59,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:32:59,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:59,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:59,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:59,347 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:32:59,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,349 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:32:59,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,350 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:32:59,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,507 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,509 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,511 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:32:59,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,529 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,530 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:59,533 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:32:59,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:59,588 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,589 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,591 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:59,593 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:32:59,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:59,610 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,614 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:32:59,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:59,649 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:32:59,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:59,667 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,668 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,672 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:32:59,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,698 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,699 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,701 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:32:59,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:59,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,722 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:59,724 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:59,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:59,726 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:32:59,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:33:00,011 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:33:00,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:33:00,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:33:00,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:33:00,014 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:33:00,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:33:00,016 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:33:00,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:33:00,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:33:00,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:33:00,037 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:33:00,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:33:00,039 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:33:00,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:33:00,041 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:33:00,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:33:00,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:33:00,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:33:00,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:33:00,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:33:00,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:33:00,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:33:00,109 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:33:00,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:33:00,111 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:33:00,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:33:00,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:33:00,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:33:00,115 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:33:00,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:33:00,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:33:00,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 13:33:00,164 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:33:00,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:33:00,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:33:00,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:33:00,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:33:00,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:33:00,198 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:33:00,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:33:00,199 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:33:00,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:33:00,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:33:00,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:33:00,218 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:33:00,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:33:00,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:33:00,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:33:00,222 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:33:00,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:33:01,840 WARN L197 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-12-23 13:33:02,105 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-23 13:33:02,670 WARN L197 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-12-23 13:33:02,912 WARN L197 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-23 13:33:02,967 INFO L131 LiptonReduction]: Checked pairs total: 8414 [2020-12-23 13:33:02,967 INFO L133 LiptonReduction]: Total number of compositions: 96 [2020-12-23 13:33:02,979 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-12-23 13:33:03,245 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4124 states. [2020-12-23 13:33:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states. [2020-12-23 13:33:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-23 13:33:03,255 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:03,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-23 13:33:03,256 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:03,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:03,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1207281, now seen corresponding path program 1 times [2020-12-23 13:33:03,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:03,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584538186] [2020-12-23 13:33:03,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:03,674 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:33:03,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584538186] [2020-12-23 13:33:03,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:03,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-23 13:33:03,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025586902] [2020-12-23 13:33:03,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 13:33:03,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:03,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 13:33:03,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:33:03,699 INFO L87 Difference]: Start difference. First operand 4124 states. Second operand 3 states. [2020-12-23 13:33:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:03,873 INFO L93 Difference]: Finished difference Result 3437 states and 13500 transitions. [2020-12-23 13:33:03,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 13:33:03,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-23 13:33:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:03,926 INFO L225 Difference]: With dead ends: 3437 [2020-12-23 13:33:03,926 INFO L226 Difference]: Without dead ends: 2812 [2020-12-23 13:33:03,927 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:33:03,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2020-12-23 13:33:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2812. [2020-12-23 13:33:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2812 states. [2020-12-23 13:33:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 10875 transitions. [2020-12-23 13:33:04,140 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 10875 transitions. Word has length 3 [2020-12-23 13:33:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:04,140 INFO L481 AbstractCegarLoop]: Abstraction has 2812 states and 10875 transitions. [2020-12-23 13:33:04,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 13:33:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 10875 transitions. [2020-12-23 13:33:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 13:33:04,144 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:04,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:33:04,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 13:33:04,145 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:04,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:04,145 INFO L82 PathProgramCache]: Analyzing trace with hash 32851231, now seen corresponding path program 1 times [2020-12-23 13:33:04,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:04,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395029836] [2020-12-23 13:33:04,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:04,267 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:33:04,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395029836] [2020-12-23 13:33:04,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:04,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-23 13:33:04,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632929029] [2020-12-23 13:33:04,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 13:33:04,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:04,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 13:33:04,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:33:04,271 INFO L87 Difference]: Start difference. First operand 2812 states and 10875 transitions. Second operand 3 states. [2020-12-23 13:33:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:04,368 INFO L93 Difference]: Finished difference Result 4995 states and 18640 transitions. [2020-12-23 13:33:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 13:33:04,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-23 13:33:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:04,412 INFO L225 Difference]: With dead ends: 4995 [2020-12-23 13:33:04,412 INFO L226 Difference]: Without dead ends: 4428 [2020-12-23 13:33:04,413 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:33:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4428 states. [2020-12-23 13:33:04,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4428 to 3924. [2020-12-23 13:33:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3924 states. [2020-12-23 13:33:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 14806 transitions. [2020-12-23 13:33:04,647 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 14806 transitions. Word has length 11 [2020-12-23 13:33:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:04,648 INFO L481 AbstractCegarLoop]: Abstraction has 3924 states and 14806 transitions. [2020-12-23 13:33:04,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 13:33:04,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 14806 transitions. [2020-12-23 13:33:04,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 13:33:04,657 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:04,658 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:33:04,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 13:33:04,658 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:04,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:04,664 INFO L82 PathProgramCache]: Analyzing trace with hash 47898464, now seen corresponding path program 1 times [2020-12-23 13:33:04,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:04,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008530443] [2020-12-23 13:33:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:04,770 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:33:04,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008530443] [2020-12-23 13:33:04,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:04,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-23 13:33:04,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199928913] [2020-12-23 13:33:04,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 13:33:04,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:04,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 13:33:04,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:33:04,772 INFO L87 Difference]: Start difference. First operand 3924 states and 14806 transitions. Second operand 3 states. [2020-12-23 13:33:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:04,881 INFO L93 Difference]: Finished difference Result 3884 states and 14624 transitions. [2020-12-23 13:33:04,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 13:33:04,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-12-23 13:33:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:04,918 INFO L225 Difference]: With dead ends: 3884 [2020-12-23 13:33:04,918 INFO L226 Difference]: Without dead ends: 3884 [2020-12-23 13:33:04,918 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:33:04,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2020-12-23 13:33:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 3740. [2020-12-23 13:33:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3740 states. [2020-12-23 13:33:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 14108 transitions. [2020-12-23 13:33:05,085 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 14108 transitions. Word has length 12 [2020-12-23 13:33:05,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:05,086 INFO L481 AbstractCegarLoop]: Abstraction has 3740 states and 14108 transitions. [2020-12-23 13:33:05,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 13:33:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 14108 transitions. [2020-12-23 13:33:05,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 13:33:05,088 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:05,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:33:05,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 13:33:05,088 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:05,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:05,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1016873629, now seen corresponding path program 1 times [2020-12-23 13:33:05,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:05,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340188740] [2020-12-23 13:33:05,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:05,252 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:33:05,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340188740] [2020-12-23 13:33:05,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:05,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 13:33:05,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66599745] [2020-12-23 13:33:05,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:33:05,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:05,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:33:05,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:33:05,255 INFO L87 Difference]: Start difference. First operand 3740 states and 14108 transitions. Second operand 4 states. [2020-12-23 13:33:05,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:05,334 INFO L93 Difference]: Finished difference Result 4252 states and 15680 transitions. [2020-12-23 13:33:05,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 13:33:05,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-23 13:33:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:05,368 INFO L225 Difference]: With dead ends: 4252 [2020-12-23 13:33:05,368 INFO L226 Difference]: Without dead ends: 4252 [2020-12-23 13:33:05,369 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:33:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2020-12-23 13:33:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 3628. [2020-12-23 13:33:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3628 states. [2020-12-23 13:33:05,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 13632 transitions. [2020-12-23 13:33:05,534 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 13632 transitions. Word has length 12 [2020-12-23 13:33:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:05,534 INFO L481 AbstractCegarLoop]: Abstraction has 3628 states and 13632 transitions. [2020-12-23 13:33:05,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:33:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 13632 transitions. [2020-12-23 13:33:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 13:33:05,537 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:05,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:33:05,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 13:33:05,537 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:05,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:05,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1483337852, now seen corresponding path program 1 times [2020-12-23 13:33:05,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:05,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495230978] [2020-12-23 13:33:05,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:05,679 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:33:05,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495230978] [2020-12-23 13:33:05,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:05,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:33:05,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982313595] [2020-12-23 13:33:05,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:33:05,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:05,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:33:05,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:33:05,682 INFO L87 Difference]: Start difference. First operand 3628 states and 13632 transitions. Second operand 4 states. [2020-12-23 13:33:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:05,766 INFO L93 Difference]: Finished difference Result 3600 states and 12232 transitions. [2020-12-23 13:33:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:33:05,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-23 13:33:05,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:05,779 INFO L225 Difference]: With dead ends: 3600 [2020-12-23 13:33:05,780 INFO L226 Difference]: Without dead ends: 2708 [2020-12-23 13:33:05,780 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:33:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2020-12-23 13:33:05,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2020-12-23 13:33:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2708 states. [2020-12-23 13:33:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 9096 transitions. [2020-12-23 13:33:05,934 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 9096 transitions. Word has length 13 [2020-12-23 13:33:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:05,935 INFO L481 AbstractCegarLoop]: Abstraction has 2708 states and 9096 transitions. [2020-12-23 13:33:05,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:33:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 9096 transitions. [2020-12-23 13:33:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 13:33:05,940 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:05,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:33:05,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 13:33:05,941 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:05,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:05,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1520464801, now seen corresponding path program 1 times [2020-12-23 13:33:05,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:05,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081037086] [2020-12-23 13:33:05,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:06,122 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:33:06,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081037086] [2020-12-23 13:33:06,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:06,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:33:06,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751587461] [2020-12-23 13:33:06,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:33:06,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:06,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:33:06,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:33:06,125 INFO L87 Difference]: Start difference. First operand 2708 states and 9096 transitions. Second operand 5 states. [2020-12-23 13:33:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:06,213 INFO L93 Difference]: Finished difference Result 2272 states and 7040 transitions. [2020-12-23 13:33:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:33:06,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-23 13:33:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:06,223 INFO L225 Difference]: With dead ends: 2272 [2020-12-23 13:33:06,223 INFO L226 Difference]: Without dead ends: 1744 [2020-12-23 13:33:06,223 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:33:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2020-12-23 13:33:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1708. [2020-12-23 13:33:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2020-12-23 13:33:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 5188 transitions. [2020-12-23 13:33:06,280 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 5188 transitions. Word has length 16 [2020-12-23 13:33:06,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:06,280 INFO L481 AbstractCegarLoop]: Abstraction has 1708 states and 5188 transitions. [2020-12-23 13:33:06,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:33:06,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 5188 transitions. [2020-12-23 13:33:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 13:33:06,285 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:06,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:33:06,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 13:33:06,285 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:06,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:06,286 INFO L82 PathProgramCache]: Analyzing trace with hash -131967121, now seen corresponding path program 1 times [2020-12-23 13:33:06,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:06,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309166215] [2020-12-23 13:33:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:06,430 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:33:06,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309166215] [2020-12-23 13:33:06,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:06,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:33:06,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20800314] [2020-12-23 13:33:06,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:33:06,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:06,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:33:06,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:33:06,432 INFO L87 Difference]: Start difference. First operand 1708 states and 5188 transitions. Second operand 4 states. [2020-12-23 13:33:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:06,486 INFO L93 Difference]: Finished difference Result 2465 states and 7317 transitions. [2020-12-23 13:33:06,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 13:33:06,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-12-23 13:33:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:06,495 INFO L225 Difference]: With dead ends: 2465 [2020-12-23 13:33:06,495 INFO L226 Difference]: Without dead ends: 1835 [2020-12-23 13:33:06,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:33:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2020-12-23 13:33:06,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1472. [2020-12-23 13:33:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1472 states. [2020-12-23 13:33:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 4350 transitions. [2020-12-23 13:33:06,550 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 4350 transitions. Word has length 19 [2020-12-23 13:33:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:06,550 INFO L481 AbstractCegarLoop]: Abstraction has 1472 states and 4350 transitions. [2020-12-23 13:33:06,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:33:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 4350 transitions. [2020-12-23 13:33:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 13:33:06,554 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:06,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:33:06,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 13:33:06,554 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:06,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash -946254808, now seen corresponding path program 1 times [2020-12-23 13:33:06,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:06,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526543724] [2020-12-23 13:33:06,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:06,668 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:33:06,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526543724] [2020-12-23 13:33:06,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:06,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 13:33:06,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971975694] [2020-12-23 13:33:06,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 13:33:06,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:06,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 13:33:06,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:33:06,671 INFO L87 Difference]: Start difference. First operand 1472 states and 4350 transitions. Second operand 6 states. [2020-12-23 13:33:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:06,741 INFO L93 Difference]: Finished difference Result 1288 states and 3777 transitions. [2020-12-23 13:33:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:33:06,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-23 13:33:06,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:06,746 INFO L225 Difference]: With dead ends: 1288 [2020-12-23 13:33:06,747 INFO L226 Difference]: Without dead ends: 1110 [2020-12-23 13:33:06,747 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:33:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2020-12-23 13:33:06,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1038. [2020-12-23 13:33:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2020-12-23 13:33:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 3095 transitions. [2020-12-23 13:33:06,780 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 3095 transitions. Word has length 19 [2020-12-23 13:33:06,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:06,781 INFO L481 AbstractCegarLoop]: Abstraction has 1038 states and 3095 transitions. [2020-12-23 13:33:06,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 13:33:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 3095 transitions. [2020-12-23 13:33:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 13:33:06,784 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:06,784 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] [2020-12-23 13:33:06,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 13:33:06,785 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:06,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:06,785 INFO L82 PathProgramCache]: Analyzing trace with hash 155561102, now seen corresponding path program 1 times [2020-12-23 13:33:06,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:06,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666548522] [2020-12-23 13:33:06,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:06,938 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:33:06,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666548522] [2020-12-23 13:33:06,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:06,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:33:06,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689343357] [2020-12-23 13:33:06,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:33:06,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:06,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:33:06,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:33:06,941 INFO L87 Difference]: Start difference. First operand 1038 states and 3095 transitions. Second operand 4 states. [2020-12-23 13:33:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:07,007 INFO L93 Difference]: Finished difference Result 1527 states and 4480 transitions. [2020-12-23 13:33:07,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:33:07,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-12-23 13:33:07,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:07,013 INFO L225 Difference]: With dead ends: 1527 [2020-12-23 13:33:07,013 INFO L226 Difference]: Without dead ends: 1246 [2020-12-23 13:33:07,015 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:33:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-12-23 13:33:07,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 961. [2020-12-23 13:33:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2020-12-23 13:33:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 2789 transitions. [2020-12-23 13:33:07,054 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 2789 transitions. Word has length 23 [2020-12-23 13:33:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:07,054 INFO L481 AbstractCegarLoop]: Abstraction has 961 states and 2789 transitions. [2020-12-23 13:33:07,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:33:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 2789 transitions. [2020-12-23 13:33:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 13:33:07,059 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:07,059 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] [2020-12-23 13:33:07,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 13:33:07,060 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:07,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:07,060 INFO L82 PathProgramCache]: Analyzing trace with hash -754864396, now seen corresponding path program 2 times [2020-12-23 13:33:07,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:07,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131776009] [2020-12-23 13:33:07,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:07,211 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:33:07,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131776009] [2020-12-23 13:33:07,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:07,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:33:07,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655045834] [2020-12-23 13:33:07,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:33:07,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:07,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:33:07,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:33:07,213 INFO L87 Difference]: Start difference. First operand 961 states and 2789 transitions. Second operand 4 states. [2020-12-23 13:33:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:07,240 INFO L93 Difference]: Finished difference Result 1423 states and 4082 transitions. [2020-12-23 13:33:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 13:33:07,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-12-23 13:33:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:07,247 INFO L225 Difference]: With dead ends: 1423 [2020-12-23 13:33:07,247 INFO L226 Difference]: Without dead ends: 954 [2020-12-23 13:33:07,247 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:33:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2020-12-23 13:33:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 951. [2020-12-23 13:33:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2020-12-23 13:33:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2676 transitions. [2020-12-23 13:33:07,282 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2676 transitions. Word has length 23 [2020-12-23 13:33:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:07,283 INFO L481 AbstractCegarLoop]: Abstraction has 951 states and 2676 transitions. [2020-12-23 13:33:07,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:33:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2676 transitions. [2020-12-23 13:33:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 13:33:07,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:07,287 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] [2020-12-23 13:33:07,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 13:33:07,287 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:07,287 INFO L82 PathProgramCache]: Analyzing trace with hash 338319421, now seen corresponding path program 1 times [2020-12-23 13:33:07,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:07,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454592433] [2020-12-23 13:33:07,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:07,457 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:33:07,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454592433] [2020-12-23 13:33:07,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:07,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 13:33:07,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159709695] [2020-12-23 13:33:07,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 13:33:07,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:07,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 13:33:07,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:33:07,462 INFO L87 Difference]: Start difference. First operand 951 states and 2676 transitions. Second operand 3 states. [2020-12-23 13:33:07,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:07,479 INFO L93 Difference]: Finished difference Result 1413 states and 3911 transitions. [2020-12-23 13:33:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 13:33:07,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-23 13:33:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:07,483 INFO L225 Difference]: With dead ends: 1413 [2020-12-23 13:33:07,484 INFO L226 Difference]: Without dead ends: 874 [2020-12-23 13:33:07,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:33:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2020-12-23 13:33:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 842. [2020-12-23 13:33:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2020-12-23 13:33:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2265 transitions. [2020-12-23 13:33:07,514 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 2265 transitions. Word has length 23 [2020-12-23 13:33:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:07,514 INFO L481 AbstractCegarLoop]: Abstraction has 842 states and 2265 transitions. [2020-12-23 13:33:07,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 13:33:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 2265 transitions. [2020-12-23 13:33:07,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 13:33:07,517 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:07,517 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] [2020-12-23 13:33:07,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 13:33:07,518 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:07,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:07,518 INFO L82 PathProgramCache]: Analyzing trace with hash 257018538, now seen corresponding path program 3 times [2020-12-23 13:33:07,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:07,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513528700] [2020-12-23 13:33:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:07,678 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:33:07,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513528700] [2020-12-23 13:33:07,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:07,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 13:33:07,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811673708] [2020-12-23 13:33:07,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 13:33:07,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:07,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 13:33:07,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:33:07,680 INFO L87 Difference]: Start difference. First operand 842 states and 2265 transitions. Second operand 7 states. [2020-12-23 13:33:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:07,757 INFO L93 Difference]: Finished difference Result 813 states and 2208 transitions. [2020-12-23 13:33:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 13:33:07,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-12-23 13:33:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:07,759 INFO L225 Difference]: With dead ends: 813 [2020-12-23 13:33:07,759 INFO L226 Difference]: Without dead ends: 316 [2020-12-23 13:33:07,760 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:33:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-12-23 13:33:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2020-12-23 13:33:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-12-23 13:33:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 859 transitions. [2020-12-23 13:33:07,769 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 859 transitions. Word has length 23 [2020-12-23 13:33:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:07,769 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 859 transitions. [2020-12-23 13:33:07,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 13:33:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 859 transitions. [2020-12-23 13:33:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:33:07,771 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:07,771 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] [2020-12-23 13:33:07,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 13:33:07,771 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:07,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:07,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1844190981, now seen corresponding path program 1 times [2020-12-23 13:33:07,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:07,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113751244] [2020-12-23 13:33:07,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:07,973 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:33:07,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113751244] [2020-12-23 13:33:07,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:07,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 13:33:07,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790184024] [2020-12-23 13:33:07,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 13:33:07,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:07,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 13:33:07,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:33:07,975 INFO L87 Difference]: Start difference. First operand 316 states and 859 transitions. Second operand 7 states. [2020-12-23 13:33:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:08,164 INFO L93 Difference]: Finished difference Result 372 states and 996 transitions. [2020-12-23 13:33:08,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:33:08,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-12-23 13:33:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:08,166 INFO L225 Difference]: With dead ends: 372 [2020-12-23 13:33:08,166 INFO L226 Difference]: Without dead ends: 316 [2020-12-23 13:33:08,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-23 13:33:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-12-23 13:33:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2020-12-23 13:33:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-12-23 13:33:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 853 transitions. [2020-12-23 13:33:08,175 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 853 transitions. Word has length 27 [2020-12-23 13:33:08,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:08,175 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 853 transitions. [2020-12-23 13:33:08,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 13:33:08,176 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 853 transitions. [2020-12-23 13:33:08,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:33:08,177 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:08,177 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] [2020-12-23 13:33:08,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 13:33:08,177 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:08,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1794240717, now seen corresponding path program 2 times [2020-12-23 13:33:08,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:08,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453410854] [2020-12-23 13:33:08,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:33:08,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:33:08,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453410854] [2020-12-23 13:33:08,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:33:08,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 13:33:08,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628900720] [2020-12-23 13:33:08,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 13:33:08,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:33:08,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 13:33:08,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-23 13:33:08,492 INFO L87 Difference]: Start difference. First operand 316 states and 853 transitions. Second operand 8 states. [2020-12-23 13:33:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:33:08,756 INFO L93 Difference]: Finished difference Result 354 states and 939 transitions. [2020-12-23 13:33:08,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:33:08,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-12-23 13:33:08,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:33:08,757 INFO L225 Difference]: With dead ends: 354 [2020-12-23 13:33:08,758 INFO L226 Difference]: Without dead ends: 172 [2020-12-23 13:33:08,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-12-23 13:33:08,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-23 13:33:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-12-23 13:33:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-12-23 13:33:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 403 transitions. [2020-12-23 13:33:08,762 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 403 transitions. Word has length 27 [2020-12-23 13:33:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:33:08,763 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 403 transitions. [2020-12-23 13:33:08,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 13:33:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 403 transitions. [2020-12-23 13:33:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:33:08,764 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:33:08,764 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] [2020-12-23 13:33:08,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 13:33:08,764 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:33:08,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:33:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash -300612481, now seen corresponding path program 3 times [2020-12-23 13:33:08,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:33:08,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372091479] [2020-12-23 13:33:08,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:33:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 13:33:08,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 13:33:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 13:33:08,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 13:33:08,981 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 13:33:08,982 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 13:33:08,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 13:33:09,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:33:09 BasicIcfg [2020-12-23 13:33:09,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 13:33:09,111 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 13:33:09,111 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 13:33:09,111 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 13:33:09,112 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:32:52" (3/4) ... [2020-12-23 13:33:09,114 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 13:33:09,329 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix055_rmo.oepc.i-witness.graphml [2020-12-23 13:33:09,329 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 13:33:09,331 INFO L168 Benchmark]: Toolchain (without parser) took 20470.44 ms. Allocated memory was 151.0 MB in the beginning and 468.7 MB in the end (delta: 317.7 MB). Free memory was 124.6 MB in the beginning and 333.4 MB in the end (delta: -208.8 MB). Peak memory consumption was 109.9 MB. Max. memory is 8.0 GB. [2020-12-23 13:33:09,331 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 13:33:09,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 841.22 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 125.8 MB in the end (delta: -1.4 MB). Peak memory consumption was 32.8 MB. Max. memory is 8.0 GB. [2020-12-23 13:33:09,332 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.49 ms. Allocated memory is still 151.0 MB. Free memory was 125.8 MB in the beginning and 123.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:33:09,332 INFO L168 Benchmark]: Boogie Preprocessor took 44.71 ms. Allocated memory is still 151.0 MB. Free memory was 123.2 MB in the beginning and 121.1 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:33:09,332 INFO L168 Benchmark]: RCFGBuilder took 2750.73 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 121.1 MB in the beginning and 75.0 MB in the end (delta: 46.2 MB). Peak memory consumption was 87.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:33:09,333 INFO L168 Benchmark]: TraceAbstraction took 16505.15 ms. Allocated memory was 181.4 MB in the beginning and 468.7 MB in the end (delta: 287.3 MB). Free memory was 74.4 MB in the beginning and 357.0 MB in the end (delta: -282.6 MB). Peak memory consumption was 4.7 MB. Max. memory is 8.0 GB. [2020-12-23 13:33:09,333 INFO L168 Benchmark]: Witness Printer took 218.43 ms. Allocated memory is still 468.7 MB. Free memory was 357.0 MB in the beginning and 333.4 MB in the end (delta: 23.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:33:09,336 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.25 ms. Allocated memory is still 151.0 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 841.22 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 125.8 MB in the end (delta: -1.4 MB). Peak memory consumption was 32.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 100.49 ms. Allocated memory is still 151.0 MB. Free memory was 125.8 MB in the beginning and 123.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.71 ms. Allocated memory is still 151.0 MB. Free memory was 123.2 MB in the beginning and 121.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2750.73 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 121.1 MB in the beginning and 75.0 MB in the end (delta: 46.2 MB). Peak memory consumption was 87.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16505.15 ms. Allocated memory was 181.4 MB in the beginning and 468.7 MB in the end (delta: 287.3 MB). Free memory was 74.4 MB in the beginning and 357.0 MB in the end (delta: -282.6 MB). Peak memory consumption was 4.7 MB. Max. memory is 8.0 GB. * Witness Printer took 218.43 ms. Allocated memory is still 468.7 MB. Free memory was 357.0 MB in the beginning and 333.4 MB in the end (delta: 23.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1807 VarBasedMoverChecksPositive, 101 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 70 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 224 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.1s, 126 PlacesBefore, 46 PlacesAfterwards, 115 TransitionsBefore, 34 TransitionsAfterwards, 2672 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 8414 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1473; [L860] FCALL, FORK 0 pthread_create(&t1473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1474; [L862] FCALL, FORK 0 pthread_create(&t1474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1475; [L864] FCALL, FORK 0 pthread_create(&t1475, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1476; [L866] FCALL, FORK 0 pthread_create(&t1476, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L818] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.1s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.4s, HoareTripleCheckerStatistics: 524 SDtfs, 586 SDslu, 815 SDs, 0 SdLazy, 302 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4124occurred 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 2063 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 29023 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...