/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/mix047_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 23:23:52,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 23:23:52,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 23:23:52,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 23:23:52,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 23:23:52,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 23:23:52,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 23:23:52,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 23:23:52,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 23:23:52,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 23:23:52,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 23:23:52,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 23:23:52,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 23:23:52,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 23:23:52,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 23:23:52,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 23:23:52,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 23:23:52,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 23:23:52,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 23:23:52,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 23:23:52,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 23:23:52,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 23:23:52,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 23:23:52,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 23:23:52,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 23:23:52,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 23:23:52,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 23:23:52,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 23:23:52,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 23:23:52,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 23:23:52,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 23:23:52,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 23:23:52,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 23:23:52,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 23:23:52,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 23:23:52,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 23:23:52,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 23:23:52,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 23:23:52,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 23:23:52,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 23:23:52,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 23:23:52,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 23:23:52,233 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 23:23:52,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 23:23:52,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 23:23:52,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 23:23:52,236 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 23:23:52,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 23:23:52,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 23:23:52,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 23:23:52,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 23:23:52,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 23:23:52,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 23:23:52,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 23:23:52,238 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 23:23:52,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 23:23:52,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 23:23:52,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 23:23:52,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 23:23:52,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:23:52,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 23:23:52,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 23:23:52,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 23:23:52,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 23:23:52,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 23:23:52,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 23:23:52,240 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 23:23:52,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 23:23:52,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 23:23:52,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 23:23:52,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 23:23:52,656 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 23:23:52,658 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 23:23:52,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i [2021-01-06 23:23:52,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a2f7d4752/b98886d6c9a342d7a03281c4b5e25420/FLAGa91592122 [2021-01-06 23:23:53,650 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 23:23:53,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i [2021-01-06 23:23:53,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a2f7d4752/b98886d6c9a342d7a03281c4b5e25420/FLAGa91592122 [2021-01-06 23:23:53,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a2f7d4752/b98886d6c9a342d7a03281c4b5e25420 [2021-01-06 23:23:53,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 23:23:53,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 23:23:53,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 23:23:53,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 23:23:53,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 23:23:53,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:23:53" (1/1) ... [2021-01-06 23:23:53,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4256d8b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:23:53, skipping insertion in model container [2021-01-06 23:23:53,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:23:53" (1/1) ... [2021-01-06 23:23:53,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 23:23:53,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 23:23:54,149 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/mix047_tso.opt.i[948,961] left hand side expression in assignment: lhs: VariableLHS[~b~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[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$flush_delayed~0,GLOBAL] [2021-01-06 23:23:54,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:23:54,427 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 23:23:54,448 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/mix047_tso.opt.i[948,961] left hand side expression in assignment: lhs: VariableLHS[~b~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[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$flush_delayed~0,GLOBAL] [2021-01-06 23:23:54,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:23:54,724 INFO L208 MainTranslator]: Completed translation [2021-01-06 23:23:54,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:23:54 WrapperNode [2021-01-06 23:23:54,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 23:23:54,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 23:23:54,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 23:23:54,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 23:23:54,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:23:54" (1/1) ... [2021-01-06 23:23:54,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:23:54" (1/1) ... [2021-01-06 23:23:54,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 23:23:54,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 23:23:54,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 23:23:54,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 23:23:54,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:23:54" (1/1) ... [2021-01-06 23:23:54,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:23:54" (1/1) ... [2021-01-06 23:23:54,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:23:54" (1/1) ... [2021-01-06 23:23:54,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:23:54" (1/1) ... [2021-01-06 23:23:54,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:23:54" (1/1) ... [2021-01-06 23:23:54,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:23:54" (1/1) ... [2021-01-06 23:23:54,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:23:54" (1/1) ... [2021-01-06 23:23:54,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 23:23:54,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 23:23:54,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 23:23:54,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 23:23:54,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:23:54" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:23:54,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 23:23:54,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-01-06 23:23:54,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 23:23:54,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 23:23:54,961 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-01-06 23:23:54,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-01-06 23:23:54,961 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-01-06 23:23:54,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-01-06 23:23:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-01-06 23:23:54,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-01-06 23:23:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-01-06 23:23:54,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-01-06 23:23:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 23:23:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-01-06 23:23:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 23:23:54,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 23:23:54,965 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-01-06 23:23:57,239 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 23:23:57,239 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-01-06 23:23:57,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:23:57 BoogieIcfgContainer [2021-01-06 23:23:57,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 23:23:57,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 23:23:57,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 23:23:57,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 23:23:57,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:23:53" (1/3) ... [2021-01-06 23:23:57,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63aeafc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:23:57, skipping insertion in model container [2021-01-06 23:23:57,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:23:54" (2/3) ... [2021-01-06 23:23:57,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63aeafc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:23:57, skipping insertion in model container [2021-01-06 23:23:57,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:23:57" (3/3) ... [2021-01-06 23:23:57,252 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_tso.opt.i [2021-01-06 23:23:57,260 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-01-06 23:23:57,260 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 23:23:57,266 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 23:23:57,267 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-01-06 23:23:57,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,308 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,308 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,309 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,309 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,313 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,313 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,316 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,316 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,321 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,321 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,322 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,322 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,322 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,323 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,323 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,324 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,326 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,327 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,327 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,327 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,328 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,328 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,333 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,334 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,336 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,336 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,340 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,341 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,342 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,343 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:23:57,344 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-01-06 23:23:57,366 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-01-06 23:23:57,390 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 23:23:57,390 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 23:23:57,391 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 23:23:57,391 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 23:23:57,391 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 23:23:57,391 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 23:23:57,391 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 23:23:57,391 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 23:23:57,406 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-01-06 23:23:57,408 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 252 flow [2021-01-06 23:23:57,412 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 252 flow [2021-01-06 23:23:57,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2021-01-06 23:23:57,476 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-01-06 23:23:57,476 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-01-06 23:23:57,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-01-06 23:23:57,487 INFO L116 LiptonReduction]: Number of co-enabled transitions 2598 [2021-01-06 23:23:57,910 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2021-01-06 23:23:58,144 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-01-06 23:23:58,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:23:58,147 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:23:58,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:23:58,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-01-06 23:23:58,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:23:58,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:23:58,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:23:58,162 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:23:58,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:23:58,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:23:58,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:23:58,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:23:58,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:23:59,561 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2021-01-06 23:24:00,095 WARN L197 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-01-06 23:24:02,484 WARN L197 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-01-06 23:24:03,519 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 267 [2021-01-06 23:24:03,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:03,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:03,653 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:03,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:03,719 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-01-06 23:24:03,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:03,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:24:03,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:03,764 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:24:03,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:03,767 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:24:03,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:03,803 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:03,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:03,805 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:03,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:03,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:03,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:03,854 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:03,854 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:03,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-01-06 23:24:03,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:03,899 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:24:03,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:04,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-01-06 23:24:04,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:04,157 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:24:04,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:04,193 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:04,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:04,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:04,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:04,376 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:04,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:04,378 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:04,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:04,411 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:04,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:04,413 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:04,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:04,448 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:04,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:04,450 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:04,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:04,452 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:04,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:04,455 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:04,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:04,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:04,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:04,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:04,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:04,484 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:04,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:04,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:04,488 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:04,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-01-06 23:24:04,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:05,154 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-01-06 23:24:05,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:05,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:24:05,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:05,204 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:05,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,206 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:05,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,264 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:24:05,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:24:05,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:05,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:05,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,492 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:05,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,493 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:05,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-01-06 23:24:05,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:05,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:24:05,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:05,677 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:05,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:05,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:05,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:05,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,762 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:05,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:05,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,798 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:05,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,800 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:05,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,830 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:24:05,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:24:05,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,868 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:05,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,870 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:05,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,939 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:05,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:05,941 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:05,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-01-06 23:24:05,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:05,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:24:05,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:06,421 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-01-06 23:24:06,529 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-01-06 23:24:07,064 WARN L197 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-01-06 23:24:07,262 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-06 23:24:07,397 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-01-06 23:24:07,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:07,399 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:24:07,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:07,431 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:07,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:07,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,545 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:07,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,547 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:07,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,571 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:07,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,575 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:07,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:07,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,614 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:07,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:07,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:07,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,789 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:07,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,790 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:07,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,799 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2021-01-06 23:24:07,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:24:07,803 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2021-01-06 23:24:07,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:07,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:07,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:07,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,853 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:07,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,857 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:07,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,858 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:07,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,863 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:07,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,864 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:07,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,867 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:07,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,910 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:07,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,913 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:07,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,949 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:07,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:07,953 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:07,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,003 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,007 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,010 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,015 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,017 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,019 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,078 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2021-01-06 23:24:08,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,079 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2021-01-06 23:24:08,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,082 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2021-01-06 23:24:08,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:24:08,085 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2021-01-06 23:24:08,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,379 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,380 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:08,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:08,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,426 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,428 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:08,430 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:08,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,603 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,604 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,626 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,627 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,629 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:08,631 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:08,686 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,687 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:08,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:08,709 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,710 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,711 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,713 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:08,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,977 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,978 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:08,979 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:08,982 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:08,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:09,001 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:09,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:09,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:09,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:09,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:09,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:09,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:09,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:09,694 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-01-06 23:24:09,890 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-01-06 23:24:10,703 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-01-06 23:24:10,804 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-01-06 23:24:11,492 WARN L197 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-01-06 23:24:11,736 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-01-06 23:24:12,278 WARN L197 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-01-06 23:24:12,534 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-01-06 23:24:12,574 INFO L131 LiptonReduction]: Checked pairs total: 6530 [2021-01-06 23:24:12,575 INFO L133 LiptonReduction]: Total number of compositions: 95 [2021-01-06 23:24:12,583 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2021-01-06 23:24:12,814 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2021-01-06 23:24:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2021-01-06 23:24:12,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 23:24:12,827 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:12,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:12,829 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:12,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:12,844 INFO L82 PathProgramCache]: Analyzing trace with hash -212030370, now seen corresponding path program 1 times [2021-01-06 23:24:12,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:12,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808493678] [2021-01-06 23:24:12,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:13,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808493678] [2021-01-06 23:24:13,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:13,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-01-06 23:24:13,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890954964] [2021-01-06 23:24:13,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:24:13,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:13,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:24:13,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:24:13,317 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2021-01-06 23:24:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:13,468 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2021-01-06 23:24:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:24:13,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2021-01-06 23:24:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:13,538 INFO L225 Difference]: With dead ends: 3082 [2021-01-06 23:24:13,538 INFO L226 Difference]: Without dead ends: 2602 [2021-01-06 23:24:13,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:24:13,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2021-01-06 23:24:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2021-01-06 23:24:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2021-01-06 23:24:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2021-01-06 23:24:13,780 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2021-01-06 23:24:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:13,784 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2021-01-06 23:24:13,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:24:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2021-01-06 23:24:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-06 23:24:13,795 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:13,795 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:13,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 23:24:13,796 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:13,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:13,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1303453965, now seen corresponding path program 1 times [2021-01-06 23:24:13,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:13,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563264323] [2021-01-06 23:24:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:14,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563264323] [2021-01-06 23:24:14,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:14,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 23:24:14,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781802910] [2021-01-06 23:24:14,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:24:14,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:14,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:24:14,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:24:14,005 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2021-01-06 23:24:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:14,090 INFO L93 Difference]: Finished difference Result 2762 states and 10352 transitions. [2021-01-06 23:24:14,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:24:14,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-01-06 23:24:14,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:14,116 INFO L225 Difference]: With dead ends: 2762 [2021-01-06 23:24:14,116 INFO L226 Difference]: Without dead ends: 2282 [2021-01-06 23:24:14,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:24:14,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2021-01-06 23:24:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2021-01-06 23:24:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2021-01-06 23:24:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2021-01-06 23:24:14,241 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 12 [2021-01-06 23:24:14,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:14,241 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2021-01-06 23:24:14,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:24:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2021-01-06 23:24:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-06 23:24:14,244 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:14,245 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:14,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 23:24:14,245 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:14,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:14,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1557426930, now seen corresponding path program 1 times [2021-01-06 23:24:14,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:14,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125285144] [2021-01-06 23:24:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:14,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125285144] [2021-01-06 23:24:14,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:14,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 23:24:14,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135612011] [2021-01-06 23:24:14,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:24:14,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:14,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:24:14,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:24:14,456 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 4 states. [2021-01-06 23:24:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:14,526 INFO L93 Difference]: Finished difference Result 2538 states and 9408 transitions. [2021-01-06 23:24:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:24:14,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2021-01-06 23:24:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:14,550 INFO L225 Difference]: With dead ends: 2538 [2021-01-06 23:24:14,551 INFO L226 Difference]: Without dead ends: 2218 [2021-01-06 23:24:14,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:24:14,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2021-01-06 23:24:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2021-01-06 23:24:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2021-01-06 23:24:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2021-01-06 23:24:14,702 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2021-01-06 23:24:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:14,703 INFO L481 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2021-01-06 23:24:14,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:24:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2021-01-06 23:24:14,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 23:24:14,707 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:14,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:14,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 23:24:14,707 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:14,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:14,708 INFO L82 PathProgramCache]: Analyzing trace with hash -898851598, now seen corresponding path program 1 times [2021-01-06 23:24:14,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:14,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662863647] [2021-01-06 23:24:14,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:14,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662863647] [2021-01-06 23:24:14,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:14,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:24:14,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208907724] [2021-01-06 23:24:14,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 23:24:14,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:14,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 23:24:14,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:24:14,874 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 6 states. [2021-01-06 23:24:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:15,164 INFO L93 Difference]: Finished difference Result 2570 states and 9585 transitions. [2021-01-06 23:24:15,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 23:24:15,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-01-06 23:24:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:15,196 INFO L225 Difference]: With dead ends: 2570 [2021-01-06 23:24:15,196 INFO L226 Difference]: Without dead ends: 2302 [2021-01-06 23:24:15,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 23:24:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2021-01-06 23:24:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2254. [2021-01-06 23:24:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2021-01-06 23:24:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 8535 transitions. [2021-01-06 23:24:15,308 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 8535 transitions. Word has length 15 [2021-01-06 23:24:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:15,309 INFO L481 AbstractCegarLoop]: Abstraction has 2254 states and 8535 transitions. [2021-01-06 23:24:15,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 23:24:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 8535 transitions. [2021-01-06 23:24:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 23:24:15,313 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:15,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:15,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 23:24:15,314 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:15,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:15,314 INFO L82 PathProgramCache]: Analyzing trace with hash -852694768, now seen corresponding path program 2 times [2021-01-06 23:24:15,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:15,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740813931] [2021-01-06 23:24:15,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:15,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740813931] [2021-01-06 23:24:15,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:15,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 23:24:15,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813811072] [2021-01-06 23:24:15,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:24:15,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:15,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:24:15,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:24:15,426 INFO L87 Difference]: Start difference. First operand 2254 states and 8535 transitions. Second operand 4 states. [2021-01-06 23:24:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:15,477 INFO L93 Difference]: Finished difference Result 2446 states and 9047 transitions. [2021-01-06 23:24:15,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:24:15,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2021-01-06 23:24:15,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:15,500 INFO L225 Difference]: With dead ends: 2446 [2021-01-06 23:24:15,500 INFO L226 Difference]: Without dead ends: 2190 [2021-01-06 23:24:15,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:24:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2021-01-06 23:24:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2190. [2021-01-06 23:24:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2190 states. [2021-01-06 23:24:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 8247 transitions. [2021-01-06 23:24:15,596 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 8247 transitions. Word has length 15 [2021-01-06 23:24:15,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:15,597 INFO L481 AbstractCegarLoop]: Abstraction has 2190 states and 8247 transitions. [2021-01-06 23:24:15,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:24:15,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 8247 transitions. [2021-01-06 23:24:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 23:24:15,601 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:15,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:15,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 23:24:15,602 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:15,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:15,603 INFO L82 PathProgramCache]: Analyzing trace with hash -616250505, now seen corresponding path program 1 times [2021-01-06 23:24:15,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:15,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474543568] [2021-01-06 23:24:15,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:15,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:15,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474543568] [2021-01-06 23:24:15,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:15,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:24:15,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600410135] [2021-01-06 23:24:15,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:24:15,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:15,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:24:15,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:24:15,717 INFO L87 Difference]: Start difference. First operand 2190 states and 8247 transitions. Second operand 4 states. [2021-01-06 23:24:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:15,781 INFO L93 Difference]: Finished difference Result 3310 states and 11991 transitions. [2021-01-06 23:24:15,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:24:15,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-01-06 23:24:15,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:15,872 INFO L225 Difference]: With dead ends: 3310 [2021-01-06 23:24:15,873 INFO L226 Difference]: Without dead ends: 2382 [2021-01-06 23:24:15,873 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:24:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2021-01-06 23:24:15,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 2126. [2021-01-06 23:24:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2021-01-06 23:24:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 7671 transitions. [2021-01-06 23:24:15,953 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 7671 transitions. Word has length 16 [2021-01-06 23:24:15,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:15,954 INFO L481 AbstractCegarLoop]: Abstraction has 2126 states and 7671 transitions. [2021-01-06 23:24:15,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:24:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 7671 transitions. [2021-01-06 23:24:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 23:24:15,961 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:15,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:15,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 23:24:15,961 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:15,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:15,962 INFO L82 PathProgramCache]: Analyzing trace with hash 394923695, now seen corresponding path program 1 times [2021-01-06 23:24:15,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:15,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267858140] [2021-01-06 23:24:15,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:16,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267858140] [2021-01-06 23:24:16,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:16,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:24:16,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943636138] [2021-01-06 23:24:16,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 23:24:16,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:16,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 23:24:16,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:24:16,198 INFO L87 Difference]: Start difference. First operand 2126 states and 7671 transitions. Second operand 6 states. [2021-01-06 23:24:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:16,376 INFO L93 Difference]: Finished difference Result 2578 states and 9223 transitions. [2021-01-06 23:24:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 23:24:16,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2021-01-06 23:24:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:16,393 INFO L225 Difference]: With dead ends: 2578 [2021-01-06 23:24:16,394 INFO L226 Difference]: Without dead ends: 2354 [2021-01-06 23:24:16,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:24:16,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2021-01-06 23:24:16,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2330. [2021-01-06 23:24:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2330 states. [2021-01-06 23:24:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 8424 transitions. [2021-01-06 23:24:16,480 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 8424 transitions. Word has length 16 [2021-01-06 23:24:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:16,480 INFO L481 AbstractCegarLoop]: Abstraction has 2330 states and 8424 transitions. [2021-01-06 23:24:16,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 23:24:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 8424 transitions. [2021-01-06 23:24:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 23:24:16,485 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:16,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:16,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 23:24:16,486 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:16,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:16,486 INFO L82 PathProgramCache]: Analyzing trace with hash 441080525, now seen corresponding path program 2 times [2021-01-06 23:24:16,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:16,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499469594] [2021-01-06 23:24:16,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:16,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499469594] [2021-01-06 23:24:16,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:16,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:24:16,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902588093] [2021-01-06 23:24:16,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 23:24:16,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:16,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 23:24:16,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:24:16,596 INFO L87 Difference]: Start difference. First operand 2330 states and 8424 transitions. Second operand 6 states. [2021-01-06 23:24:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:16,719 INFO L93 Difference]: Finished difference Result 2498 states and 8860 transitions. [2021-01-06 23:24:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 23:24:16,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2021-01-06 23:24:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:16,732 INFO L225 Difference]: With dead ends: 2498 [2021-01-06 23:24:16,733 INFO L226 Difference]: Without dead ends: 2274 [2021-01-06 23:24:16,733 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:24:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2021-01-06 23:24:16,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2274. [2021-01-06 23:24:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2274 states. [2021-01-06 23:24:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 8176 transitions. [2021-01-06 23:24:16,810 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 8176 transitions. Word has length 16 [2021-01-06 23:24:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:16,811 INFO L481 AbstractCegarLoop]: Abstraction has 2274 states and 8176 transitions. [2021-01-06 23:24:16,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 23:24:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 8176 transitions. [2021-01-06 23:24:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 23:24:16,816 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:16,816 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:16,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 23:24:16,817 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash 788564047, now seen corresponding path program 1 times [2021-01-06 23:24:16,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:16,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254573910] [2021-01-06 23:24:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:16,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254573910] [2021-01-06 23:24:16,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:16,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:24:16,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337770657] [2021-01-06 23:24:16,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 23:24:16,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 23:24:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:24:16,973 INFO L87 Difference]: Start difference. First operand 2274 states and 8176 transitions. Second operand 6 states. [2021-01-06 23:24:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:17,205 INFO L93 Difference]: Finished difference Result 2910 states and 10268 transitions. [2021-01-06 23:24:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 23:24:17,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-01-06 23:24:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:17,220 INFO L225 Difference]: With dead ends: 2910 [2021-01-06 23:24:17,220 INFO L226 Difference]: Without dead ends: 2658 [2021-01-06 23:24:17,221 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-01-06 23:24:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2021-01-06 23:24:17,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2362. [2021-01-06 23:24:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2021-01-06 23:24:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 8352 transitions. [2021-01-06 23:24:17,327 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 8352 transitions. Word has length 17 [2021-01-06 23:24:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:17,327 INFO L481 AbstractCegarLoop]: Abstraction has 2362 states and 8352 transitions. [2021-01-06 23:24:17,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 23:24:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 8352 transitions. [2021-01-06 23:24:17,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:24:17,334 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:17,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:17,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 23:24:17,335 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:17,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:17,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1500258638, now seen corresponding path program 1 times [2021-01-06 23:24:17,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:17,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564255303] [2021-01-06 23:24:17,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:17,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564255303] [2021-01-06 23:24:17,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:17,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:24:17,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550475624] [2021-01-06 23:24:17,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:24:17,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:17,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:24:17,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:24:17,475 INFO L87 Difference]: Start difference. First operand 2362 states and 8352 transitions. Second operand 4 states. [2021-01-06 23:24:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:17,532 INFO L93 Difference]: Finished difference Result 2468 states and 7932 transitions. [2021-01-06 23:24:17,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:24:17,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2021-01-06 23:24:17,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:17,543 INFO L225 Difference]: With dead ends: 2468 [2021-01-06 23:24:17,543 INFO L226 Difference]: Without dead ends: 1860 [2021-01-06 23:24:17,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:24:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2021-01-06 23:24:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1860. [2021-01-06 23:24:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2021-01-06 23:24:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 5956 transitions. [2021-01-06 23:24:17,615 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 5956 transitions. Word has length 18 [2021-01-06 23:24:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:17,615 INFO L481 AbstractCegarLoop]: Abstraction has 1860 states and 5956 transitions. [2021-01-06 23:24:17,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:24:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 5956 transitions. [2021-01-06 23:24:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 23:24:17,620 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:17,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:17,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 23:24:17,620 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:17,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:17,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1691256525, now seen corresponding path program 1 times [2021-01-06 23:24:17,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:17,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894935849] [2021-01-06 23:24:17,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:17,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894935849] [2021-01-06 23:24:17,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:17,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:24:17,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513390544] [2021-01-06 23:24:17,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:24:17,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:17,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:24:17,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:24:17,753 INFO L87 Difference]: Start difference. First operand 1860 states and 5956 transitions. Second operand 5 states. [2021-01-06 23:24:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:17,813 INFO L93 Difference]: Finished difference Result 1586 states and 4616 transitions. [2021-01-06 23:24:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 23:24:17,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2021-01-06 23:24:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:17,819 INFO L225 Difference]: With dead ends: 1586 [2021-01-06 23:24:17,819 INFO L226 Difference]: Without dead ends: 1194 [2021-01-06 23:24:17,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:24:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2021-01-06 23:24:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2021-01-06 23:24:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2021-01-06 23:24:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 3402 transitions. [2021-01-06 23:24:17,856 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 3402 transitions. Word has length 19 [2021-01-06 23:24:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:17,856 INFO L481 AbstractCegarLoop]: Abstraction has 1194 states and 3402 transitions. [2021-01-06 23:24:17,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:24:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 3402 transitions. [2021-01-06 23:24:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 23:24:17,859 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:17,860 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:17,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 23:24:17,860 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:17,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:17,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1807945115, now seen corresponding path program 1 times [2021-01-06 23:24:17,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:17,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879637927] [2021-01-06 23:24:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:17,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879637927] [2021-01-06 23:24:17,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:17,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:24:17,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111154323] [2021-01-06 23:24:17,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:24:17,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:17,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:24:17,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:24:17,935 INFO L87 Difference]: Start difference. First operand 1194 states and 3402 transitions. Second operand 4 states. [2021-01-06 23:24:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:17,975 INFO L93 Difference]: Finished difference Result 1745 states and 4762 transitions. [2021-01-06 23:24:17,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:24:17,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2021-01-06 23:24:17,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:17,980 INFO L225 Difference]: With dead ends: 1745 [2021-01-06 23:24:17,980 INFO L226 Difference]: Without dead ends: 1214 [2021-01-06 23:24:17,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:24:17,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2021-01-06 23:24:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1162. [2021-01-06 23:24:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2021-01-06 23:24:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 3142 transitions. [2021-01-06 23:24:18,015 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 3142 transitions. Word has length 21 [2021-01-06 23:24:18,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:18,016 INFO L481 AbstractCegarLoop]: Abstraction has 1162 states and 3142 transitions. [2021-01-06 23:24:18,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:24:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 3142 transitions. [2021-01-06 23:24:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 23:24:18,019 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:18,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:18,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 23:24:18,019 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash 744690865, now seen corresponding path program 1 times [2021-01-06 23:24:18,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:18,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048223041] [2021-01-06 23:24:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:18,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048223041] [2021-01-06 23:24:18,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:18,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 23:24:18,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966182200] [2021-01-06 23:24:18,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 23:24:18,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:18,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 23:24:18,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:24:18,139 INFO L87 Difference]: Start difference. First operand 1162 states and 3142 transitions. Second operand 6 states. [2021-01-06 23:24:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:18,209 INFO L93 Difference]: Finished difference Result 989 states and 2610 transitions. [2021-01-06 23:24:18,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:24:18,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2021-01-06 23:24:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:18,213 INFO L225 Difference]: With dead ends: 989 [2021-01-06 23:24:18,213 INFO L226 Difference]: Without dead ends: 794 [2021-01-06 23:24:18,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:24:18,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2021-01-06 23:24:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 714. [2021-01-06 23:24:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2021-01-06 23:24:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1858 transitions. [2021-01-06 23:24:18,234 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1858 transitions. Word has length 21 [2021-01-06 23:24:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:18,236 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 1858 transitions. [2021-01-06 23:24:18,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 23:24:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1858 transitions. [2021-01-06 23:24:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 23:24:18,240 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:18,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:18,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 23:24:18,240 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:18,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:18,241 INFO L82 PathProgramCache]: Analyzing trace with hash -630177842, now seen corresponding path program 1 times [2021-01-06 23:24:18,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:18,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899547565] [2021-01-06 23:24:18,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:18,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899547565] [2021-01-06 23:24:18,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:18,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:24:18,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897293226] [2021-01-06 23:24:18,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:24:18,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:18,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:24:18,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:24:18,352 INFO L87 Difference]: Start difference. First operand 714 states and 1858 transitions. Second operand 5 states. [2021-01-06 23:24:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:18,398 INFO L93 Difference]: Finished difference Result 932 states and 2356 transitions. [2021-01-06 23:24:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:24:18,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2021-01-06 23:24:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:18,401 INFO L225 Difference]: With dead ends: 932 [2021-01-06 23:24:18,401 INFO L226 Difference]: Without dead ends: 503 [2021-01-06 23:24:18,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:24:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-01-06 23:24:18,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 497. [2021-01-06 23:24:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2021-01-06 23:24:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1160 transitions. [2021-01-06 23:24:18,415 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1160 transitions. Word has length 24 [2021-01-06 23:24:18,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:18,415 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 1160 transitions. [2021-01-06 23:24:18,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:24:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1160 transitions. [2021-01-06 23:24:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 23:24:18,417 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:18,418 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:18,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 23:24:18,418 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:18,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:18,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1375101256, now seen corresponding path program 1 times [2021-01-06 23:24:18,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:18,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473375413] [2021-01-06 23:24:18,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:18,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473375413] [2021-01-06 23:24:18,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:18,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 23:24:18,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17764543] [2021-01-06 23:24:18,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 23:24:18,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:18,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 23:24:18,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:24:18,638 INFO L87 Difference]: Start difference. First operand 497 states and 1160 transitions. Second operand 8 states. [2021-01-06 23:24:18,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:18,817 INFO L93 Difference]: Finished difference Result 605 states and 1371 transitions. [2021-01-06 23:24:18,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 23:24:18,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2021-01-06 23:24:18,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:18,819 INFO L225 Difference]: With dead ends: 605 [2021-01-06 23:24:18,819 INFO L226 Difference]: Without dead ends: 328 [2021-01-06 23:24:18,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-01-06 23:24:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-01-06 23:24:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2021-01-06 23:24:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2021-01-06 23:24:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 700 transitions. [2021-01-06 23:24:18,829 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 700 transitions. Word has length 24 [2021-01-06 23:24:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:18,829 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 700 transitions. [2021-01-06 23:24:18,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 23:24:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 700 transitions. [2021-01-06 23:24:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 23:24:18,830 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:18,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:18,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 23:24:18,831 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:18,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1317308865, now seen corresponding path program 1 times [2021-01-06 23:24:18,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:18,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31367406] [2021-01-06 23:24:18,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:24:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:24:18,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31367406] [2021-01-06 23:24:18,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:24:18,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 23:24:18,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521535278] [2021-01-06 23:24:18,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 23:24:18,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:24:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 23:24:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:24:18,944 INFO L87 Difference]: Start difference. First operand 322 states and 700 transitions. Second operand 7 states. [2021-01-06 23:24:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:24:19,020 INFO L93 Difference]: Finished difference Result 293 states and 643 transitions. [2021-01-06 23:24:19,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 23:24:19,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2021-01-06 23:24:19,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:24:19,022 INFO L225 Difference]: With dead ends: 293 [2021-01-06 23:24:19,022 INFO L226 Difference]: Without dead ends: 65 [2021-01-06 23:24:19,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:24:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-01-06 23:24:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-01-06 23:24:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2021-01-06 23:24:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2021-01-06 23:24:19,025 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 24 [2021-01-06 23:24:19,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:24:19,025 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2021-01-06 23:24:19,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 23:24:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2021-01-06 23:24:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:24:19,026 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:24:19,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:24:19,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 23:24:19,026 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:24:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:24:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash 189494572, now seen corresponding path program 1 times [2021-01-06 23:24:19,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:24:19,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983042581] [2021-01-06 23:24:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:24:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:24:19,076 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:24:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:24:19,126 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:24:19,171 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 23:24:19,171 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 23:24:19,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 23:24:19,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:24:19 BasicIcfg [2021-01-06 23:24:19,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 23:24:19,299 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 23:24:19,299 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 23:24:19,299 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 23:24:19,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:23:57" (3/4) ... [2021-01-06 23:24:19,302 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 23:24:19,441 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix047_tso.opt.i-witness.graphml [2021-01-06 23:24:19,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 23:24:19,443 INFO L168 Benchmark]: Toolchain (without parser) took 25567.44 ms. Allocated memory was 152.0 MB in the beginning and 460.3 MB in the end (delta: 308.3 MB). Free memory was 125.4 MB in the beginning and 291.5 MB in the end (delta: -166.1 MB). Peak memory consumption was 142.9 MB. Max. memory is 8.0 GB. [2021-01-06 23:24:19,443 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 152.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 23:24:19,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.76 ms. Allocated memory is still 152.0 MB. Free memory was 125.2 MB in the beginning and 126.0 MB in the end (delta: -815.1 kB). Peak memory consumption was 32.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:24:19,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.38 ms. Allocated memory is still 152.0 MB. Free memory was 126.0 MB in the beginning and 123.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:24:19,444 INFO L168 Benchmark]: Boogie Preprocessor took 51.55 ms. Allocated memory is still 152.0 MB. Free memory was 123.3 MB in the beginning and 120.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:24:19,445 INFO L168 Benchmark]: RCFGBuilder took 2388.77 ms. Allocated memory was 152.0 MB in the beginning and 195.0 MB in the end (delta: 43.0 MB). Free memory was 120.7 MB in the beginning and 133.9 MB in the end (delta: -13.2 MB). Peak memory consumption was 89.0 MB. Max. memory is 8.0 GB. [2021-01-06 23:24:19,445 INFO L168 Benchmark]: TraceAbstraction took 22054.57 ms. Allocated memory was 195.0 MB in the beginning and 460.3 MB in the end (delta: 265.3 MB). Free memory was 133.4 MB in the beginning and 309.9 MB in the end (delta: -176.5 MB). Peak memory consumption was 88.8 MB. Max. memory is 8.0 GB. [2021-01-06 23:24:19,446 INFO L168 Benchmark]: Witness Printer took 142.83 ms. Allocated memory is still 460.3 MB. Free memory was 309.9 MB in the beginning and 291.5 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2021-01-06 23:24:19,448 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.22 ms. Allocated memory is still 152.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 845.76 ms. Allocated memory is still 152.0 MB. Free memory was 125.2 MB in the beginning and 126.0 MB in the end (delta: -815.1 kB). Peak memory consumption was 32.1 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 70.38 ms. Allocated memory is still 152.0 MB. Free memory was 126.0 MB in the beginning and 123.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 51.55 ms. Allocated memory is still 152.0 MB. Free memory was 123.3 MB in the beginning and 120.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2388.77 ms. Allocated memory was 152.0 MB in the beginning and 195.0 MB in the end (delta: 43.0 MB). Free memory was 120.7 MB in the beginning and 133.9 MB in the end (delta: -13.2 MB). Peak memory consumption was 89.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 22054.57 ms. Allocated memory was 195.0 MB in the beginning and 460.3 MB in the end (delta: 265.3 MB). Free memory was 133.4 MB in the beginning and 309.9 MB in the end (delta: -176.5 MB). Peak memory consumption was 88.8 MB. Max. memory is 8.0 GB. * Witness Printer took 142.83 ms. Allocated memory is still 460.3 MB. Free memory was 309.9 MB in the beginning and 291.5 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1554 VarBasedMoverChecksPositive, 74 VarBasedMoverChecksNegative, 24 SemBasedMoverChecksPositive, 50 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 168 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 15.1s, 127 PlacesBefore, 46 PlacesAfterwards, 116 TransitionsBefore, 34 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 6530 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1277; [L845] FCALL, FORK 0 pthread_create(&t1277, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1278; [L847] FCALL, FORK 0 pthread_create(&t1278, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1279; [L849] FCALL, FORK 0 pthread_create(&t1279, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1280; [L851] FCALL, FORK 0 pthread_create(&t1280, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L783] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.4s, HoareTripleCheckerStatistics: 648 SDtfs, 773 SDslu, 1260 SDs, 0 SdLazy, 430 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 768 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 24438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...