/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/thin000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 13:46:55,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 13:46:55,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 13:46:55,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 13:46:55,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 13:46:55,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 13:46:55,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 13:46:55,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 13:46:55,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 13:46:55,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 13:46:55,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 13:46:55,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 13:46:55,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 13:46:55,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 13:46:55,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 13:46:55,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 13:46:55,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 13:46:55,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 13:46:55,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 13:46:55,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 13:46:55,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 13:46:55,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 13:46:55,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 13:46:55,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 13:46:55,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 13:46:55,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 13:46:55,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 13:46:55,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 13:46:55,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 13:46:55,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 13:46:55,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 13:46:55,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 13:46:55,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 13:46:55,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 13:46:55,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 13:46:55,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 13:46:55,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 13:46:55,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 13:46:55,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 13:46:55,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 13:46:55,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 13:46:55,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 13:46:55,878 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 13:46:55,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 13:46:55,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 13:46:55,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 13:46:55,883 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 13:46:55,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 13:46:55,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 13:46:55,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 13:46:55,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 13:46:55,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 13:46:55,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 13:46:55,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 13:46:55,885 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 13:46:55,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 13:46:55,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 13:46:55,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 13:46:55,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 13:46:55,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 13:46:55,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 13:46:55,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 13:46:55,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 13:46:55,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 13:46:55,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 13:46:55,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 13:46:55,888 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 13:46:55,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 13:46:56,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 13:46:56,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 13:46:56,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 13:46:56,326 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 13:46:56,327 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 13:46:56,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/thin000_rmo.oepc.i [2020-12-23 13:46:56,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ddd136b69/02137d7c7ca74df98c4200d1d76a136e/FLAGb9ed96695 [2020-12-23 13:46:57,124 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 13:46:57,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/thin000_rmo.oepc.i [2020-12-23 13:46:57,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ddd136b69/02137d7c7ca74df98c4200d1d76a136e/FLAGb9ed96695 [2020-12-23 13:46:57,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ddd136b69/02137d7c7ca74df98c4200d1d76a136e [2020-12-23 13:46:57,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 13:46:57,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 13:46:57,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 13:46:57,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 13:46:57,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 13:46:57,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:46:57" (1/1) ... [2020-12-23 13:46:57,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3515a78b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:57, skipping insertion in model container [2020-12-23 13:46:57,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:46:57" (1/1) ... [2020-12-23 13:46:57,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 13:46:57,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 13:46:57,692 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/thin000_rmo.oepc.i[993,1006] 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[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX$read_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX$read_delayed_var~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$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[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2020-12-23 13:46:58,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:46:58,099 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 13:46:58,116 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/thin000_rmo.oepc.i[993,1006] 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[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$mem_tmp~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX$read_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX$read_delayed_var~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$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: address: IdentifierExpression[~#y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2020-12-23 13:46:58,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:46:58,395 INFO L208 MainTranslator]: Completed translation [2020-12-23 13:46:58,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58 WrapperNode [2020-12-23 13:46:58,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 13:46:58,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 13:46:58,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 13:46:58,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 13:46:58,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 13:46:58,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 13:46:58,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 13:46:58,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 13:46:58,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 13:46:58,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 13:46:58,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 13:46:58,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 13:46:58,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 13:46:58,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 13:46:58,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 13:46:58,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 13:46:58,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... [2020-12-23 13:46:58,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 13:46:58,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 13:46:58,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 13:46:58,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 13:46:58,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 13:46:58,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 13:46:58,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 13:46:58,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-23 13:46:58,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 13:46:58,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 13:46:58,645 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-23 13:46:58,645 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-23 13:46:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-23 13:46:58,646 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-23 13:46:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 13:46:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-23 13:46:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 13:46:58,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 13:46:58,648 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-23 13:47:00,756 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 13:47:00,757 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2020-12-23 13:47:00,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:47:00 BoogieIcfgContainer [2020-12-23 13:47:00,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 13:47:00,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 13:47:00,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 13:47:00,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 13:47:00,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:46:57" (1/3) ... [2020-12-23 13:47:00,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1025b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:47:00, skipping insertion in model container [2020-12-23 13:47:00,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:58" (2/3) ... [2020-12-23 13:47:00,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1025b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:47:00, skipping insertion in model container [2020-12-23 13:47:00,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:47:00" (3/3) ... [2020-12-23 13:47:00,767 INFO L111 eAbstractionObserver]: Analyzing ICFG thin000_rmo.oepc.i [2020-12-23 13:47:00,774 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-23 13:47:00,775 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 13:47:00,780 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 13:47:00,781 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-23 13:47:00,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,821 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,821 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,821 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,822 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,842 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,842 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,843 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,843 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,851 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,853 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,858 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,858 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:47:00,861 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-23 13:47:00,880 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-12-23 13:47:00,904 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 13:47:00,904 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 13:47:00,904 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 13:47:00,905 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 13:47:00,905 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 13:47:00,905 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 13:47:00,905 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 13:47:00,905 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 13:47:00,919 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-23 13:47:00,921 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 95 transitions, 200 flow [2020-12-23 13:47:00,924 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 95 transitions, 200 flow [2020-12-23 13:47:00,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 200 flow [2020-12-23 13:47:00,974 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-12-23 13:47:00,974 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-23 13:47:00,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2020-12-23 13:47:00,981 INFO L116 LiptonReduction]: Number of co-enabled transitions 782 [2020-12-23 13:47:01,099 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:01,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:01,228 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:01,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:01,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:01,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:01,453 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-23 13:47:01,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:01,454 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:01,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:01,548 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:47:01,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:01,550 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-12-23 13:47:01,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:01,552 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 2, 1] term [2020-12-23 13:47:01,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:01,554 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2020-12-23 13:47:01,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:01,555 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:01,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:01,556 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:01,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:01,558 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:01,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:02,421 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:02,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:02,423 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:02,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:02,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:02,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:02,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:02,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:03,713 WARN L197 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2020-12-23 13:47:04,229 WARN L197 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2020-12-23 13:47:06,420 WARN L197 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 322 DAG size of output: 278 [2020-12-23 13:47:07,441 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 275 [2020-12-23 13:47:07,526 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:07,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:07,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:07,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:07,545 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:07,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:07,546 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:07,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:08,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:08,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:08,007 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:08,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:08,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:08,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:08,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:08,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:08,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:08,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:08,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:08,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:08,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:08,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:08,376 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:08,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:08,377 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:08,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:08,729 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:08,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:08,730 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:08,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:08,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:08,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:08,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:08,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:09,419 WARN L197 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2020-12-23 13:47:09,574 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-12-23 13:47:10,176 WARN L197 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 98 [2020-12-23 13:47:10,410 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-23 13:47:10,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:10,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:10,589 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:10,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,213 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:11,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,219 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:11,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,222 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:47:11,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:11,223 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:11,225 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:11,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:11,228 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:11,274 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:47:11,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 13:47:11,277 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:47:11,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:11,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,339 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:47:11,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 13:47:11,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:47:11,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:11,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,383 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,390 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,391 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,392 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:11,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,394 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:11,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:11,396 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:47:11,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:11,398 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:11,399 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:11,400 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:11,401 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:11,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:12,018 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-12-23 13:47:12,125 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-12-23 13:47:12,350 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-23 13:47:12,823 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,825 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,827 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,827 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,829 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:12,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,831 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,831 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:12,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,833 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:12,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,835 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:47:12,837 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:47:12,859 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,863 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,864 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,865 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:12,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,867 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:12,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,868 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,869 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:12,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:12,870 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:12,872 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:12,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:13,072 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-12-23 13:47:13,333 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-12-23 13:47:13,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:13,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-23 13:47:13,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,450 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:13,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:47:13,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:13,490 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-12-23 13:47:13,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:13,492 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 2, 1] term [2020-12-23 13:47:13,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,493 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:13,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,494 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2020-12-23 13:47:13,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,494 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:13,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,495 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:13,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,786 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-12-23 13:47:13,904 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-12-23 13:47:13,918 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:13,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,919 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:13,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,955 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:47:13,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:13,956 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-12-23 13:47:13,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:13,958 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 2, 1] term [2020-12-23 13:47:13,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,959 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:13,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2020-12-23 13:47:13,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:13,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,962 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:13,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:13,991 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:13,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,001 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-23 13:47:14,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:14,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,024 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:14,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,057 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,058 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,059 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,060 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:14,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,062 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:14,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,065 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:14,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:14,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:14,091 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,094 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,095 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,096 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,096 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:14,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,098 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,099 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:14,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,101 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:14,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:14,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:47:14,104 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:47:14,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:47:14,630 WARN L197 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-12-23 13:47:14,863 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-12-23 13:47:15,349 WARN L197 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-12-23 13:47:15,579 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-12-23 13:47:15,605 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:47:15,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:15,607 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-12-23 13:47:15,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:47:15,608 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 2, 1] term [2020-12-23 13:47:15,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:15,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:15,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:15,610 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2020-12-23 13:47:15,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:15,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:15,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:15,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:15,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:15,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:47:15,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:15,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-23 13:47:15,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:15,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-23 13:47:15,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:47:16,448 WARN L197 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 150 [2020-12-23 13:47:16,833 WARN L197 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2020-12-23 13:47:17,593 WARN L197 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 150 [2020-12-23 13:47:17,943 WARN L197 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2020-12-23 13:47:17,947 INFO L131 LiptonReduction]: Checked pairs total: 1773 [2020-12-23 13:47:17,947 INFO L133 LiptonReduction]: Total number of compositions: 86 [2020-12-23 13:47:17,954 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 17 transitions, 44 flow [2020-12-23 13:47:17,968 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110 states. [2020-12-23 13:47:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2020-12-23 13:47:17,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-23 13:47:17,976 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:47:17,977 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:47:17,977 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:47:17,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:47:17,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1859649584, now seen corresponding path program 1 times [2020-12-23 13:47:17,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:47:17,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763294228] [2020-12-23 13:47:17,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:47:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:47:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:47:18,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763294228] [2020-12-23 13:47:18,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:47:18,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-23 13:47:18,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393137517] [2020-12-23 13:47:18,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 13:47:18,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:47:18,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 13:47:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:47:18,392 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 3 states. [2020-12-23 13:47:18,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:47:18,431 INFO L93 Difference]: Finished difference Result 105 states and 237 transitions. [2020-12-23 13:47:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 13:47:18,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-23 13:47:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:47:18,444 INFO L225 Difference]: With dead ends: 105 [2020-12-23 13:47:18,444 INFO L226 Difference]: Without dead ends: 85 [2020-12-23 13:47:18,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:47:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-12-23 13:47:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-12-23 13:47:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-12-23 13:47:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 186 transitions. [2020-12-23 13:47:18,506 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 186 transitions. Word has length 7 [2020-12-23 13:47:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:47:18,506 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 186 transitions. [2020-12-23 13:47:18,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 13:47:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 186 transitions. [2020-12-23 13:47:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 13:47:18,508 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:47:18,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:47:18,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 13:47:18,508 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:47:18,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:47:18,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1815335521, now seen corresponding path program 1 times [2020-12-23 13:47:18,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:47:18,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187425343] [2020-12-23 13:47:18,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:47:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:47:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:47:18,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187425343] [2020-12-23 13:47:18,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:47:18,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-23 13:47:18,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456269957] [2020-12-23 13:47:18,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 13:47:18,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:47:18,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 13:47:18,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:47:18,672 INFO L87 Difference]: Start difference. First operand 85 states and 186 transitions. Second operand 3 states. [2020-12-23 13:47:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:47:18,681 INFO L93 Difference]: Finished difference Result 82 states and 178 transitions. [2020-12-23 13:47:18,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 13:47:18,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-12-23 13:47:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:47:18,683 INFO L225 Difference]: With dead ends: 82 [2020-12-23 13:47:18,683 INFO L226 Difference]: Without dead ends: 82 [2020-12-23 13:47:18,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:47:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-12-23 13:47:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-12-23 13:47:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-12-23 13:47:18,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 178 transitions. [2020-12-23 13:47:18,694 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 178 transitions. Word has length 8 [2020-12-23 13:47:18,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:47:18,694 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 178 transitions. [2020-12-23 13:47:18,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 13:47:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 178 transitions. [2020-12-23 13:47:18,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-23 13:47:18,695 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:47:18,696 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:47:18,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 13:47:18,696 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:47:18,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:47:18,696 INFO L82 PathProgramCache]: Analyzing trace with hash 440825002, now seen corresponding path program 1 times [2020-12-23 13:47:18,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:47:18,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948818579] [2020-12-23 13:47:18,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:47:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:47:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:47:18,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948818579] [2020-12-23 13:47:18,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:47:18,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 13:47:18,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460567900] [2020-12-23 13:47:18,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:47:18,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:47:18,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:47:18,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:47:18,827 INFO L87 Difference]: Start difference. First operand 82 states and 178 transitions. Second operand 4 states. [2020-12-23 13:47:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:47:18,856 INFO L93 Difference]: Finished difference Result 102 states and 213 transitions. [2020-12-23 13:47:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 13:47:18,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-23 13:47:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:47:18,861 INFO L225 Difference]: With dead ends: 102 [2020-12-23 13:47:18,862 INFO L226 Difference]: Without dead ends: 54 [2020-12-23 13:47:18,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:47:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-23 13:47:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-12-23 13:47:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-23 13:47:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 103 transitions. [2020-12-23 13:47:18,874 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 103 transitions. Word has length 9 [2020-12-23 13:47:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:47:18,874 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 103 transitions. [2020-12-23 13:47:18,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:47:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 103 transitions. [2020-12-23 13:47:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-23 13:47:18,879 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:47:18,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:47:18,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 13:47:18,879 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:47:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:47:18,880 INFO L82 PathProgramCache]: Analyzing trace with hash 757583848, now seen corresponding path program 1 times [2020-12-23 13:47:18,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:47:18,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656097807] [2020-12-23 13:47:18,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:47:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:47:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:47:19,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656097807] [2020-12-23 13:47:19,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:47:19,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:47:19,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355972894] [2020-12-23 13:47:19,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 13:47:19,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:47:19,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 13:47:19,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:47:19,118 INFO L87 Difference]: Start difference. First operand 54 states and 103 transitions. Second operand 6 states. [2020-12-23 13:47:19,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:47:19,266 INFO L93 Difference]: Finished difference Result 52 states and 98 transitions. [2020-12-23 13:47:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 13:47:19,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-23 13:47:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:47:19,272 INFO L225 Difference]: With dead ends: 52 [2020-12-23 13:47:19,272 INFO L226 Difference]: Without dead ends: 52 [2020-12-23 13:47:19,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:47:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-23 13:47:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-12-23 13:47:19,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-23 13:47:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 98 transitions. [2020-12-23 13:47:19,286 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 98 transitions. Word has length 10 [2020-12-23 13:47:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:47:19,290 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 98 transitions. [2020-12-23 13:47:19,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 13:47:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 98 transitions. [2020-12-23 13:47:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 13:47:19,291 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:47:19,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:47:19,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 13:47:19,292 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:47:19,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:47:19,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2010260918, now seen corresponding path program 1 times [2020-12-23 13:47:19,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:47:19,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292613635] [2020-12-23 13:47:19,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:47:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:47:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:47:19,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292613635] [2020-12-23 13:47:19,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:47:19,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:47:19,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787352698] [2020-12-23 13:47:19,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:47:19,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:47:19,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:47:19,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:47:19,487 INFO L87 Difference]: Start difference. First operand 52 states and 98 transitions. Second operand 4 states. [2020-12-23 13:47:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:47:19,518 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2020-12-23 13:47:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 13:47:19,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-23 13:47:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:47:19,519 INFO L225 Difference]: With dead ends: 50 [2020-12-23 13:47:19,519 INFO L226 Difference]: Without dead ends: 38 [2020-12-23 13:47:19,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:47:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-23 13:47:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-12-23 13:47:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-23 13:47:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 60 transitions. [2020-12-23 13:47:19,524 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 60 transitions. Word has length 11 [2020-12-23 13:47:19,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:47:19,524 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 60 transitions. [2020-12-23 13:47:19,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:47:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 60 transitions. [2020-12-23 13:47:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 13:47:19,525 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:47:19,525 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:47:19,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 13:47:19,526 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:47:19,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:47:19,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1104384328, now seen corresponding path program 1 times [2020-12-23 13:47:19,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:47:19,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074490306] [2020-12-23 13:47:19,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:47:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:47:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:47:19,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074490306] [2020-12-23 13:47:19,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:47:19,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:47:19,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391588170] [2020-12-23 13:47:19,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:47:19,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:47:19,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:47:19,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:47:19,628 INFO L87 Difference]: Start difference. First operand 38 states and 60 transitions. Second operand 5 states. [2020-12-23 13:47:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:47:19,676 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2020-12-23 13:47:19,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:47:19,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-23 13:47:19,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:47:19,677 INFO L225 Difference]: With dead ends: 31 [2020-12-23 13:47:19,677 INFO L226 Difference]: Without dead ends: 25 [2020-12-23 13:47:19,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:47:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-23 13:47:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-12-23 13:47:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-12-23 13:47:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2020-12-23 13:47:19,681 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 12 [2020-12-23 13:47:19,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:47:19,681 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-12-23 13:47:19,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:47:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2020-12-23 13:47:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-23 13:47:19,682 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:47:19,682 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:47:19,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 13:47:19,683 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:47:19,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:47:19,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1015099560, now seen corresponding path program 1 times [2020-12-23 13:47:19,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:47:19,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692826184] [2020-12-23 13:47:19,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:47:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 13:47:19,745 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 13:47:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 13:47:19,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 13:47:19,844 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 13:47:19,844 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 13:47:19,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 13:47:19,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:47:19 BasicIcfg [2020-12-23 13:47:19,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 13:47:19,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 13:47:19,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 13:47:19,929 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 13:47:19,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:47:00" (3/4) ... [2020-12-23 13:47:19,932 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 13:47:20,035 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/thin000_rmo.oepc.i-witness.graphml [2020-12-23 13:47:20,036 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 13:47:20,037 INFO L168 Benchmark]: Toolchain (without parser) took 22603.27 ms. Allocated memory was 151.0 MB in the beginning and 426.8 MB in the end (delta: 275.8 MB). Free memory was 124.3 MB in the beginning and 313.7 MB in the end (delta: -189.4 MB). Peak memory consumption was 86.9 MB. Max. memory is 8.0 GB. [2020-12-23 13:47:20,037 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 151.0 MB. Free memory is still 122.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 13:47:20,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 959.88 ms. Allocated memory is still 151.0 MB. Free memory was 124.1 MB in the beginning and 126.0 MB in the end (delta: -2.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 8.0 GB. [2020-12-23 13:47:20,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.75 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 123.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:47:20,038 INFO L168 Benchmark]: Boogie Preprocessor took 37.33 ms. Allocated memory is still 151.0 MB. Free memory was 123.9 MB in the beginning and 121.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:47:20,039 INFO L168 Benchmark]: RCFGBuilder took 2221.46 ms. Allocated memory was 151.0 MB in the beginning and 199.2 MB in the end (delta: 48.2 MB). Free memory was 121.8 MB in the beginning and 149.9 MB in the end (delta: -28.1 MB). Peak memory consumption was 92.5 MB. Max. memory is 8.0 GB. [2020-12-23 13:47:20,039 INFO L168 Benchmark]: TraceAbstraction took 19167.74 ms. Allocated memory was 199.2 MB in the beginning and 426.8 MB in the end (delta: 227.5 MB). Free memory was 149.9 MB in the beginning and 325.8 MB in the end (delta: -175.8 MB). Peak memory consumption was 51.7 MB. Max. memory is 8.0 GB. [2020-12-23 13:47:20,040 INFO L168 Benchmark]: Witness Printer took 106.63 ms. Allocated memory is still 426.8 MB. Free memory was 325.8 MB in the beginning and 313.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-12-23 13:47:20,043 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.16 ms. Allocated memory is still 151.0 MB. Free memory is still 122.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 959.88 ms. Allocated memory is still 151.0 MB. Free memory was 124.1 MB in the beginning and 126.0 MB in the end (delta: -2.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 99.75 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 123.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 37.33 ms. Allocated memory is still 151.0 MB. Free memory was 123.9 MB in the beginning and 121.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2221.46 ms. Allocated memory was 151.0 MB in the beginning and 199.2 MB in the end (delta: 48.2 MB). Free memory was 121.8 MB in the beginning and 149.9 MB in the end (delta: -28.1 MB). Peak memory consumption was 92.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 19167.74 ms. Allocated memory was 199.2 MB in the beginning and 426.8 MB in the end (delta: 227.5 MB). Free memory was 149.9 MB in the beginning and 325.8 MB in the end (delta: -175.8 MB). Peak memory consumption was 51.7 MB. Max. memory is 8.0 GB. * Witness Printer took 106.63 ms. Allocated memory is still 426.8 MB. Free memory was 325.8 MB in the beginning and 313.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 490 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 3 SemBasedMoverChecksPositive, 31 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 53 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 17.0s, 100 PlacesBefore, 24 PlacesAfterwards, 95 TransitionsBefore, 17 TransitionsAfterwards, 782 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 1773 MoverChecksTotal - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t2673; [L813] FCALL, FORK 0 pthread_create(&t2673, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] 0 pthread_t t2674; [L815] FCALL, FORK 0 pthread_create(&t2674, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=0, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L784] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 0 !(!cond) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=255, weak$$choice2=255, x=1, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.9s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.0s, HoareTripleCheckerStatistics: 75 SDtfs, 82 SDslu, 75 SDs, 0 SdLazy, 56 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 3147 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...