/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/mix041_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 23:22:13,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 23:22:13,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 23:22:13,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 23:22:13,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 23:22:13,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 23:22:13,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 23:22:13,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 23:22:13,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 23:22:13,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 23:22:13,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 23:22:13,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 23:22:13,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 23:22:13,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 23:22:13,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 23:22:13,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 23:22:13,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 23:22:13,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 23:22:13,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 23:22:13,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 23:22:13,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 23:22:13,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 23:22:13,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 23:22:13,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 23:22:13,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 23:22:13,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 23:22:13,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 23:22:13,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 23:22:13,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 23:22:13,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 23:22:13,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 23:22:13,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 23:22:13,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 23:22:13,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 23:22:13,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 23:22:13,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 23:22:13,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 23:22:13,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 23:22:13,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 23:22:13,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 23:22:13,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 23:22:13,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 23:22:13,286 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 23:22:13,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 23:22:13,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 23:22:13,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 23:22:13,292 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 23:22:13,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 23:22:13,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 23:22:13,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 23:22:13,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 23:22:13,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 23:22:13,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 23:22:13,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 23:22:13,294 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 23:22:13,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 23:22:13,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 23:22:13,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 23:22:13,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 23:22:13,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:22:13,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 23:22:13,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 23:22:13,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 23:22:13,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 23:22:13,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 23:22:13,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 23:22:13,297 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 23:22:13,297 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 [2021-01-06 23:22:13,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 23:22:13,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 23:22:13,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 23:22:13,719 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 23:22:13,719 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 23:22:13,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix041_tso.opt.i [2021-01-06 23:22:13,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4af9a4f8f/6707dbfcc5d94cedbff86fb7414bd307/FLAG93e25bcea [2021-01-06 23:22:14,481 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 23:22:14,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_tso.opt.i [2021-01-06 23:22:14,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4af9a4f8f/6707dbfcc5d94cedbff86fb7414bd307/FLAG93e25bcea [2021-01-06 23:22:14,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4af9a4f8f/6707dbfcc5d94cedbff86fb7414bd307 [2021-01-06 23:22:14,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 23:22:14,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 23:22:14,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 23:22:14,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 23:22:14,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 23:22:14,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:22:14" (1/1) ... [2021-01-06 23:22:14,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9166b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:22:14, skipping insertion in model container [2021-01-06 23:22:14,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:22:14" (1/1) ... [2021-01-06 23:22:14,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 23:22:14,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 23:22:15,063 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/mix041_tso.opt.i[948,961] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$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$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$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[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~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[~x$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL] [2021-01-06 23:22:15,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:22:15,396 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 23:22:15,416 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/mix041_tso.opt.i[948,961] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$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$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$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[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~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[~x$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL] [2021-01-06 23:22:15,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:22:15,659 INFO L208 MainTranslator]: Completed translation [2021-01-06 23:22:15,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:22:15 WrapperNode [2021-01-06 23:22:15,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 23:22:15,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 23:22:15,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 23:22:15,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 23:22:15,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:22:15" (1/1) ... [2021-01-06 23:22:15,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:22:15" (1/1) ... [2021-01-06 23:22:15,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 23:22:15,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 23:22:15,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 23:22:15,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 23:22:15,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:22:15" (1/1) ... [2021-01-06 23:22:15,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:22:15" (1/1) ... [2021-01-06 23:22:15,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:22:15" (1/1) ... [2021-01-06 23:22:15,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:22:15" (1/1) ... [2021-01-06 23:22:15,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:22:15" (1/1) ... [2021-01-06 23:22:15,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:22:15" (1/1) ... [2021-01-06 23:22:15,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:22:15" (1/1) ... [2021-01-06 23:22:15,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 23:22:15,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 23:22:15,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 23:22:15,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 23:22:15,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:22:15" (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 [2021-01-06 23:22:15,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 23:22:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-01-06 23:22:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 23:22:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 23:22:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-01-06 23:22:15,909 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-01-06 23:22:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-01-06 23:22:15,910 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-01-06 23:22:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 23:22:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-01-06 23:22:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 23:22:15,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 23:22:15,913 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-01-06 23:22:18,138 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 23:22:18,138 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-01-06 23:22:18,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:22:18 BoogieIcfgContainer [2021-01-06 23:22:18,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 23:22:18,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 23:22:18,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 23:22:18,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 23:22:18,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:22:14" (1/3) ... [2021-01-06 23:22:18,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3f332d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:22:18, skipping insertion in model container [2021-01-06 23:22:18,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:22:15" (2/3) ... [2021-01-06 23:22:18,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3f332d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:22:18, skipping insertion in model container [2021-01-06 23:22:18,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:22:18" (3/3) ... [2021-01-06 23:22:18,149 INFO L111 eAbstractionObserver]: Analyzing ICFG mix041_tso.opt.i [2021-01-06 23:22:18,157 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-01-06 23:22:18,157 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 23:22:18,163 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 23:22:18,164 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-01-06 23:22:18,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,200 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,200 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,201 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,201 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,206 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,206 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,207 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,207 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,207 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,207 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,208 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,208 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,215 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,216 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,216 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,221 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,221 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:22:18,222 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-01-06 23:22:18,242 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-01-06 23:22:18,266 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 23:22:18,266 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 23:22:18,266 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 23:22:18,266 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 23:22:18,266 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 23:22:18,267 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 23:22:18,267 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 23:22:18,267 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 23:22:18,281 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-01-06 23:22:18,284 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 178 flow [2021-01-06 23:22:18,287 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 178 flow [2021-01-06 23:22:18,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 178 flow [2021-01-06 23:22:18,351 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-01-06 23:22:18,351 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-01-06 23:22:18,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-01-06 23:22:18,363 INFO L116 LiptonReduction]: Number of co-enabled transitions 1046 [2021-01-06 23:22:18,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:18,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:18,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:18,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:18,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-01-06 23:22:18,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:18,655 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2021-01-06 23:22:18,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:18,815 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:18,816 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:18,819 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:18,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:18,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:18,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:18,827 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:18,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:22:18,830 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:18,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:22:18,834 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:18,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:22:18,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:22:18,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:18,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:22:18,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:18,844 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:22:18,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:18,926 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:18,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:18,928 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:18,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:18,932 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2021-01-06 23:22:18,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:22:18,936 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2021-01-06 23:22:18,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:19,085 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-01-06 23:22:19,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:19,086 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2021-01-06 23:22:19,087 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:19,120 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:19,121 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:19,121 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:19,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:19,639 WARN L197 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-01-06 23:22:20,251 WARN L197 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-01-06 23:22:20,466 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-01-06 23:22:21,858 WARN L197 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-01-06 23:22:22,382 WARN L197 SmtUtils]: Spent 521.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-01-06 23:22:24,710 WARN L197 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 310 DAG size of output: 265 [2021-01-06 23:22:25,761 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 262 [2021-01-06 23:22:26,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:26,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:26,009 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2021-01-06 23:22:26,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:22:26,016 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2021-01-06 23:22:26,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,084 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:26,087 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,089 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,089 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:22:26,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:22:26,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:22:26,109 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:22:26,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:22:26,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,114 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:22:26,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:26,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,592 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:26,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:26,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,634 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:26,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:26,699 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,701 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:22:26,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:22:26,709 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:22:26,711 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:22:26,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,715 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:22:26,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,717 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:22:26,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:26,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:26,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2021-01-06 23:22:26,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:22:26,795 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2021-01-06 23:22:26,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:26,875 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:26,876 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:26,878 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:22:26,880 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:22:26,900 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:26,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:26,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:22:26,906 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:26,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:22:27,164 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-01-06 23:22:27,292 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-01-06 23:22:27,524 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-06 23:22:27,759 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-06 23:22:28,114 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:28,115 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:28,117 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:22:28,120 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:22:28,144 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:28,147 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:28,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:22:28,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:22:28,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:28,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,295 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:28,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,327 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:28,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,328 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:28,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,451 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:28,453 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:28,456 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:22:28,458 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:22:28,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:28,490 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:28,492 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,495 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:28,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,535 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:28,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,565 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:28,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,566 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:28,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,594 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:28,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:28,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:28,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:28,623 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:22:28,625 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:28,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:22:28,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:28,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,683 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:28,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,711 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:28,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,712 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:28,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:28,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:28,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,782 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:28,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:28,783 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:28,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:29,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:29,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-01-06 23:22:29,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:29,067 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2021-01-06 23:22:29,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:29,170 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:29,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:29,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:29,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,208 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:29,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:29,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,481 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:29,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,484 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2021-01-06 23:22:29,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:22:29,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2021-01-06 23:22:29,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:29,533 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,537 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,541 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,543 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,545 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,603 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:22:29,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,616 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,620 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,623 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:22:29,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,675 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:22:29,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,676 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-01-06 23:22:29,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:29,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2021-01-06 23:22:29,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:22:29,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2021-01-06 23:22:29,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:22:30,128 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-01-06 23:22:30,308 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-01-06 23:22:30,726 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-01-06 23:22:30,829 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-01-06 23:22:31,669 WARN L197 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-01-06 23:22:31,878 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-01-06 23:22:32,317 WARN L197 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-01-06 23:22:32,524 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-01-06 23:22:32,530 INFO L131 LiptonReduction]: Checked pairs total: 2678 [2021-01-06 23:22:32,530 INFO L133 LiptonReduction]: Total number of compositions: 74 [2021-01-06 23:22:32,538 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2021-01-06 23:22:32,578 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 222 states. [2021-01-06 23:22:32,580 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states. [2021-01-06 23:22:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-06 23:22:32,587 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:32,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-06 23:22:32,588 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:32,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:32,601 INFO L82 PathProgramCache]: Analyzing trace with hash 890989874, now seen corresponding path program 1 times [2021-01-06 23:22:32,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:32,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610147951] [2021-01-06 23:22:32,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:22:32,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610147951] [2021-01-06 23:22:32,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:32,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-01-06 23:22:32,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734880229] [2021-01-06 23:22:32,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:22:32,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:32,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:22:32,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:22:32,940 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 3 states. [2021-01-06 23:22:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:33,009 INFO L93 Difference]: Finished difference Result 192 states and 464 transitions. [2021-01-06 23:22:33,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:22:33,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-06 23:22:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:33,027 INFO L225 Difference]: With dead ends: 192 [2021-01-06 23:22:33,027 INFO L226 Difference]: Without dead ends: 162 [2021-01-06 23:22:33,029 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 [2021-01-06 23:22:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-01-06 23:22:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-01-06 23:22:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2021-01-06 23:22:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 385 transitions. [2021-01-06 23:22:33,092 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 385 transitions. Word has length 5 [2021-01-06 23:22:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:33,093 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 385 transitions. [2021-01-06 23:22:33,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:22:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 385 transitions. [2021-01-06 23:22:33,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-06 23:22:33,094 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:33,094 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:22:33,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 23:22:33,095 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:33,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:33,095 INFO L82 PathProgramCache]: Analyzing trace with hash 582903437, now seen corresponding path program 1 times [2021-01-06 23:22:33,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:33,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655986526] [2021-01-06 23:22:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:22:33,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655986526] [2021-01-06 23:22:33,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:33,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 23:22:33,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647001993] [2021-01-06 23:22:33,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:22:33,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:33,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:22:33,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:22:33,322 INFO L87 Difference]: Start difference. First operand 162 states and 385 transitions. Second operand 4 states. [2021-01-06 23:22:33,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:33,382 INFO L93 Difference]: Finished difference Result 172 states and 388 transitions. [2021-01-06 23:22:33,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:22:33,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-01-06 23:22:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:33,385 INFO L225 Difference]: With dead ends: 172 [2021-01-06 23:22:33,385 INFO L226 Difference]: Without dead ends: 142 [2021-01-06 23:22:33,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:22:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-01-06 23:22:33,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-01-06 23:22:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2021-01-06 23:22:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 329 transitions. [2021-01-06 23:22:33,410 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 329 transitions. Word has length 8 [2021-01-06 23:22:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:33,410 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 329 transitions. [2021-01-06 23:22:33,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:22:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 329 transitions. [2021-01-06 23:22:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-06 23:22:33,411 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:33,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:22:33,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 23:22:33,411 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:33,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1824672131, now seen corresponding path program 1 times [2021-01-06 23:22:33,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:33,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902583354] [2021-01-06 23:22:33,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:22:33,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902583354] [2021-01-06 23:22:33,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:33,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 23:22:33,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472515209] [2021-01-06 23:22:33,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 23:22:33,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:33,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 23:22:33,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:22:33,724 INFO L87 Difference]: Start difference. First operand 142 states and 329 transitions. Second operand 7 states. [2021-01-06 23:22:33,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:33,929 INFO L93 Difference]: Finished difference Result 172 states and 379 transitions. [2021-01-06 23:22:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:22:33,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2021-01-06 23:22:33,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:33,932 INFO L225 Difference]: With dead ends: 172 [2021-01-06 23:22:33,933 INFO L226 Difference]: Without dead ends: 148 [2021-01-06 23:22:33,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-01-06 23:22:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-01-06 23:22:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-01-06 23:22:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2021-01-06 23:22:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 332 transitions. [2021-01-06 23:22:33,945 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 332 transitions. Word has length 10 [2021-01-06 23:22:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:33,946 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 332 transitions. [2021-01-06 23:22:33,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 23:22:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 332 transitions. [2021-01-06 23:22:33,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-06 23:22:33,948 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:33,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:22:33,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 23:22:33,948 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:33,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:33,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1162320772, now seen corresponding path program 1 times [2021-01-06 23:22:33,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:33,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979827451] [2021-01-06 23:22:33,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:22:34,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979827451] [2021-01-06 23:22:34,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:34,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:22:34,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035560449] [2021-01-06 23:22:34,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:22:34,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:34,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:22:34,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:22:34,038 INFO L87 Difference]: Start difference. First operand 148 states and 332 transitions. Second operand 4 states. [2021-01-06 23:22:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:34,074 INFO L93 Difference]: Finished difference Result 126 states and 239 transitions. [2021-01-06 23:22:34,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:22:34,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-01-06 23:22:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:34,076 INFO L225 Difference]: With dead ends: 126 [2021-01-06 23:22:34,076 INFO L226 Difference]: Without dead ends: 90 [2021-01-06 23:22:34,078 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 [2021-01-06 23:22:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-01-06 23:22:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-01-06 23:22:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2021-01-06 23:22:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 158 transitions. [2021-01-06 23:22:34,086 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 158 transitions. Word has length 12 [2021-01-06 23:22:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:34,086 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 158 transitions. [2021-01-06 23:22:34,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:22:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 158 transitions. [2021-01-06 23:22:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-06 23:22:34,090 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:34,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:22:34,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 23:22:34,090 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:34,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:34,091 INFO L82 PathProgramCache]: Analyzing trace with hash 520454832, now seen corresponding path program 1 times [2021-01-06 23:22:34,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:34,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135467248] [2021-01-06 23:22:34,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:22:34,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135467248] [2021-01-06 23:22:34,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:34,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:22:34,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617721677] [2021-01-06 23:22:34,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:22:34,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:34,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:22:34,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:22:34,294 INFO L87 Difference]: Start difference. First operand 90 states and 158 transitions. Second operand 5 states. [2021-01-06 23:22:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:34,335 INFO L93 Difference]: Finished difference Result 65 states and 106 transitions. [2021-01-06 23:22:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 23:22:34,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2021-01-06 23:22:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:34,337 INFO L225 Difference]: With dead ends: 65 [2021-01-06 23:22:34,337 INFO L226 Difference]: Without dead ends: 52 [2021-01-06 23:22:34,337 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 [2021-01-06 23:22:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-01-06 23:22:34,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2021-01-06 23:22:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-01-06 23:22:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2021-01-06 23:22:34,341 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 13 [2021-01-06 23:22:34,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:34,341 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 73 transitions. [2021-01-06 23:22:34,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:22:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 73 transitions. [2021-01-06 23:22:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 23:22:34,342 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:34,342 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:22:34,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 23:22:34,342 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:34,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:34,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1400578064, now seen corresponding path program 1 times [2021-01-06 23:22:34,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:34,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523722789] [2021-01-06 23:22:34,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:22:34,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523722789] [2021-01-06 23:22:34,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:34,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:22:34,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301283620] [2021-01-06 23:22:34,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:22:34,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:34,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:22:34,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:22:34,462 INFO L87 Difference]: Start difference. First operand 46 states and 73 transitions. Second operand 5 states. [2021-01-06 23:22:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:34,503 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2021-01-06 23:22:34,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:22:34,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2021-01-06 23:22:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:34,504 INFO L225 Difference]: With dead ends: 61 [2021-01-06 23:22:34,504 INFO L226 Difference]: Without dead ends: 26 [2021-01-06 23:22:34,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:22:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-01-06 23:22:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-01-06 23:22:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-01-06 23:22:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-01-06 23:22:34,508 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2021-01-06 23:22:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:34,508 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-01-06 23:22:34,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:22:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-01-06 23:22:34,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 23:22:34,511 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:34,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:22:34,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 23:22:34,511 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:34,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:34,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2011900584, now seen corresponding path program 2 times [2021-01-06 23:22:34,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:34,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133895777] [2021-01-06 23:22:34,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:22:34,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133895777] [2021-01-06 23:22:34,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:34,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 23:22:34,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940270373] [2021-01-06 23:22:34,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 23:22:34,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:34,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 23:22:34,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:22:34,678 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2021-01-06 23:22:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:34,792 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-01-06 23:22:34,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:22:34,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2021-01-06 23:22:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:34,793 INFO L225 Difference]: With dead ends: 35 [2021-01-06 23:22:34,793 INFO L226 Difference]: Without dead ends: 22 [2021-01-06 23:22:34,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:22:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-01-06 23:22:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-01-06 23:22:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-01-06 23:22:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-01-06 23:22:34,796 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2021-01-06 23:22:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:34,796 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-01-06 23:22:34,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 23:22:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-01-06 23:22:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 23:22:34,797 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:34,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:22:34,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 23:22:34,798 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:34,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:34,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1626783234, now seen corresponding path program 3 times [2021-01-06 23:22:34,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:34,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22777628] [2021-01-06 23:22:34,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:22:34,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:22:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:22:34,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:22:35,003 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 23:22:35,003 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 23:22:35,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 23:22:35,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:22:35 BasicIcfg [2021-01-06 23:22:35,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 23:22:35,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 23:22:35,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 23:22:35,097 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 23:22:35,098 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:22:18" (3/4) ... [2021-01-06 23:22:35,107 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 23:22:35,226 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix041_tso.opt.i-witness.graphml [2021-01-06 23:22:35,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 23:22:35,228 INFO L168 Benchmark]: Toolchain (without parser) took 20443.76 ms. Allocated memory was 151.0 MB in the beginning and 317.7 MB in the end (delta: 166.7 MB). Free memory was 124.6 MB in the beginning and 253.9 MB in the end (delta: -129.2 MB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. [2021-01-06 23:22:35,228 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 23:22:35,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 870.95 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 123.5 MB in the end (delta: 903.0 kB). Peak memory consumption was 28.6 MB. Max. memory is 8.0 GB. [2021-01-06 23:22:35,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.65 ms. Allocated memory is still 151.0 MB. Free memory was 123.5 MB in the beginning and 120.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:22:35,229 INFO L168 Benchmark]: Boogie Preprocessor took 58.01 ms. Allocated memory is still 151.0 MB. Free memory was 120.9 MB in the beginning and 118.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:22:35,230 INFO L168 Benchmark]: RCFGBuilder took 2350.78 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 118.8 MB in the beginning and 112.2 MB in the end (delta: 6.6 MB). Peak memory consumption was 79.0 MB. Max. memory is 8.0 GB. [2021-01-06 23:22:35,230 INFO L168 Benchmark]: TraceAbstraction took 16953.79 ms. Allocated memory was 181.4 MB in the beginning and 317.7 MB in the end (delta: 136.3 MB). Free memory was 111.7 MB in the beginning and 263.3 MB in the end (delta: -151.6 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 23:22:35,231 INFO L168 Benchmark]: Witness Printer took 129.38 ms. Allocated memory is still 317.7 MB. Free memory was 263.3 MB in the beginning and 253.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-01-06 23:22:35,234 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.24 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 870.95 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 123.5 MB in the end (delta: 903.0 kB). Peak memory consumption was 28.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 66.65 ms. Allocated memory is still 151.0 MB. Free memory was 123.5 MB in the beginning and 120.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 58.01 ms. Allocated memory is still 151.0 MB. Free memory was 120.9 MB in the beginning and 118.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2350.78 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 118.8 MB in the beginning and 112.2 MB in the end (delta: 6.6 MB). Peak memory consumption was 79.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16953.79 ms. Allocated memory was 181.4 MB in the beginning and 317.7 MB in the end (delta: 136.3 MB). Free memory was 111.7 MB in the beginning and 263.3 MB in the end (delta: -151.6 MB). There was no memory consumed. Max. memory is 8.0 GB. * Witness Printer took 129.38 ms. Allocated memory is still 317.7 MB. Free memory was 263.3 MB in the beginning and 253.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 690 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 33 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 99 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 14.2s, 89 PlacesBefore, 28 PlacesAfterwards, 84 TransitionsBefore, 22 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 2678 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1103; [L803] FCALL, FORK 0 pthread_create(&t1103, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1104; [L805] FCALL, FORK 0 pthread_create(&t1104, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.7s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.3s, HoareTripleCheckerStatistics: 137 SDtfs, 153 SDslu, 228 SDs, 0 SdLazy, 120 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred 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: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 6128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...