java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec6_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:32:59,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:32:59,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:32:59,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:32:59,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:32:59,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:32:59,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:32:59,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:32:59,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:32:59,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:32:59,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:32:59,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:32:59,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:32:59,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:32:59,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:32:59,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:32:59,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:32:59,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:32:59,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:32:59,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:32:59,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:32:59,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:32:59,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:32:59,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:32:59,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:32:59,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:32:59,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:32:59,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:32:59,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:32:59,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:32:59,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:32:59,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:32:59,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:32:59,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:32:59,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:32:59,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:32:59,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:32:59,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:32:59,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:32:59,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:32:59,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:32:59,265 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 05:32:59,298 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:32:59,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:32:59,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:32:59,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:32:59,300 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:32:59,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:32:59,301 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:32:59,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:32:59,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:32:59,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:32:59,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:32:59,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:32:59,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:32:59,302 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:32:59,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:32:59,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:32:59,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:32:59,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:32:59,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:32:59,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:32:59,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:32:59,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:32:59,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:32:59,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:32:59,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:32:59,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:32:59,304 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:32:59,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:32:59,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:32:59,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:32:59,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:32:59,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:32:59,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:32:59,351 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:32:59,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_productSimulator.cil.c [2019-09-08 05:32:59,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8822af7cb/00bb5c03b5b44a96934b55a9960f4035/FLAG7e829c6de [2019-09-08 05:33:00,048 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:33:00,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_productSimulator.cil.c [2019-09-08 05:33:00,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8822af7cb/00bb5c03b5b44a96934b55a9960f4035/FLAG7e829c6de [2019-09-08 05:33:00,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8822af7cb/00bb5c03b5b44a96934b55a9960f4035 [2019-09-08 05:33:00,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:33:00,248 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:33:00,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:33:00,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:33:00,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:33:00,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:33:00" (1/1) ... [2019-09-08 05:33:00,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3b021a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:00, skipping insertion in model container [2019-09-08 05:33:00,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:33:00" (1/1) ... [2019-09-08 05:33:00,262 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:33:00,346 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:33:01,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:33:01,142 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:33:01,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:33:01,468 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:33:01,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:01 WrapperNode [2019-09-08 05:33:01,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:33:01,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:33:01,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:33:01,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:33:01,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:01" (1/1) ... [2019-09-08 05:33:01,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:01" (1/1) ... [2019-09-08 05:33:01,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:01" (1/1) ... [2019-09-08 05:33:01,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:01" (1/1) ... [2019-09-08 05:33:01,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:01" (1/1) ... [2019-09-08 05:33:01,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:01" (1/1) ... [2019-09-08 05:33:01,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:01" (1/1) ... [2019-09-08 05:33:01,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:33:01,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:33:01,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:33:01,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:33:01,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-09-08 05:33:01,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:33:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:33:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:33:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-08 05:33:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-08 05:33:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:33:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:33:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:33:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:33:01,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:33:01,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:33:01,711 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-09-08 05:33:01,711 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-09-08 05:33:01,711 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-09-08 05:33:01,712 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-09-08 05:33:01,712 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-09-08 05:33:01,712 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-09-08 05:33:01,712 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:33:01,713 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-09-08 05:33:01,713 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-09-08 05:33:01,713 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:33:01,714 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:33:01,714 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:33:01,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:33:01,715 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:33:01,715 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:33:01,715 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:33:01,715 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:33:01,715 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:33:01,716 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:33:01,716 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:33:01,716 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:33:01,716 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:33:01,716 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:33:01,717 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:33:01,717 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:33:01,717 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:33:01,717 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:33:01,717 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:33:01,717 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:33:01,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:33:01,718 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:33:01,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:33:01,718 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:33:01,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:33:01,718 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:33:01,719 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:33:01,719 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:33:01,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:33:01,719 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:33:01,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:33:01,720 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:33:01,720 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:33:01,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:33:01,720 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:33:01,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:33:01,720 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:33:01,721 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:33:01,721 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:33:01,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-09-08 05:33:01,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-09-08 05:33:01,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:33:01,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-09-08 05:33:01,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-09-08 05:33:01,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:33:01,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-09-08 05:33:01,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-09-08 05:33:01,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:33:01,723 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:33:01,723 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:33:01,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:33:01,723 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:33:01,724 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:33:01,724 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:33:01,724 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:33:01,724 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:33:01,724 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:33:01,724 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:33:01,725 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:33:01,725 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:33:01,725 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:33:01,725 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:33:01,725 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:33:01,726 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:33:01,726 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:33:01,726 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:33:01,726 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:33:01,726 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:33:01,727 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:33:01,727 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:33:01,727 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:33:01,727 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:33:01,727 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:33:01,727 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:33:01,728 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:33:01,728 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:33:01,728 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:33:01,728 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:33:01,728 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:33:01,729 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:33:01,729 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:33:01,729 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:33:01,729 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:33:01,729 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:33:01,729 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:33:01,730 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:33:01,730 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-09-08 05:33:01,730 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-09-08 05:33:01,730 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-09-08 05:33:01,730 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-09-08 05:33:01,730 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-09-08 05:33:01,731 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-09-08 05:33:01,731 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:33:01,731 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:33:01,731 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-09-08 05:33:01,731 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-09-08 05:33:01,731 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-09-08 05:33:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-09-08 05:33:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-09-08 05:33:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-09-08 05:33:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-09-08 05:33:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-09-08 05:33:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:33:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:33:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:33:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:33:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:33:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:33:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:33:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:33:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:33:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:33:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:33:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:33:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:33:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:33:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:33:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:33:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:33:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:33:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:33:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:33:01,736 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:33:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:33:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:33:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-08 05:33:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:33:01,737 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-08 05:33:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:33:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:33:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:33:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:33:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:33:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:33:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:33:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:33:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:33:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:33:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:33:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:33:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:33:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:33:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:33:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:33:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:33:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:33:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:33:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:33:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:33:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:33:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:33:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:33:01,742 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:33:01,742 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:33:01,742 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:33:01,742 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:33:01,742 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-09-08 05:33:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-09-08 05:33:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-09-08 05:33:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-09-08 05:33:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-09-08 05:33:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-09-08 05:33:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-09-08 05:33:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-09-08 05:33:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:33:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:33:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:33:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:33:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:33:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:33:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:33:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:33:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:33:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:33:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:33:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:33:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:33:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:33:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:33:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:33:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:33:01,747 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:33:01,747 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:33:01,747 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:33:01,747 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:33:01,747 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:33:01,747 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:33:01,748 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:33:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:33:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:33:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:33:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:33:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:33:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:33:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:33:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:33:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:33:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:33:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:33:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:33:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:33:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:33:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:33:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:33:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:33:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:33:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:33:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:33:01,778 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:33:01,778 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:33:01,778 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:33:01,778 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:33:01,778 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:33:01,778 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:33:01,778 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:33:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:33:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:33:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:33:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:33:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:33:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:33:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:33:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:33:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-09-08 05:33:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-09-08 05:33:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-09-08 05:33:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-09-08 05:33:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-09-08 05:33:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-09-08 05:33:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:33:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:33:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:33:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:33:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:33:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:33:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:33:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:33:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:33:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:33:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:33:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:33:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:33:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:33:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:33:01,783 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:33:01,783 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:33:01,783 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:33:01,783 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:33:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:33:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:33:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-09-08 05:33:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-09-08 05:33:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-09-08 05:33:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-09-08 05:33:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-09-08 05:33:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-09-08 05:33:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-09-08 05:33:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-09-08 05:33:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-09-08 05:33:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-09-08 05:33:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-09-08 05:33:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-09-08 05:33:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-09-08 05:33:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-09-08 05:33:01,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:33:01,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:33:01,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:33:04,226 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:33:04,227 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:33:04,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:33:04 BoogieIcfgContainer [2019-09-08 05:33:04,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:33:04,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:33:04,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:33:04,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:33:04,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:33:00" (1/3) ... [2019-09-08 05:33:04,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5191a115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:33:04, skipping insertion in model container [2019-09-08 05:33:04,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:01" (2/3) ... [2019-09-08 05:33:04,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5191a115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:33:04, skipping insertion in model container [2019-09-08 05:33:04,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:33:04" (3/3) ... [2019-09-08 05:33:04,239 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_productSimulator.cil.c [2019-09-08 05:33:04,251 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:33:04,267 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:33:04,288 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:33:04,339 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:33:04,340 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:33:04,340 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:33:04,341 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:33:04,341 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:33:04,341 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:33:04,341 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:33:04,341 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:33:04,341 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:33:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2019-09-08 05:33:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 05:33:04,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:04,429 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-09-08 05:33:04,434 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:04,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:04,441 INFO L82 PathProgramCache]: Analyzing trace with hash 924149196, now seen corresponding path program 1 times [2019-09-08 05:33:04,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:04,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:04,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:04,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:04,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:33:05,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:05,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:33:05,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:33:05,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:33:05,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:33:05,322 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 6 states. [2019-09-08 05:33:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:05,573 INFO L93 Difference]: Finished difference Result 1562 states and 2158 transitions. [2019-09-08 05:33:05,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:33:05,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2019-09-08 05:33:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:05,617 INFO L225 Difference]: With dead ends: 1562 [2019-09-08 05:33:05,618 INFO L226 Difference]: Without dead ends: 793 [2019-09-08 05:33:05,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:33:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-09-08 05:33:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2019-09-08 05:33:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-09-08 05:33:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1079 transitions. [2019-09-08 05:33:05,804 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1079 transitions. Word has length 201 [2019-09-08 05:33:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:05,813 INFO L475 AbstractCegarLoop]: Abstraction has 793 states and 1079 transitions. [2019-09-08 05:33:05,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:33:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1079 transitions. [2019-09-08 05:33:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 05:33:05,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:05,822 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:05,823 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:05,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:05,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1049194950, now seen corresponding path program 1 times [2019-09-08 05:33:05,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:05,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:05,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:05,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:05,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:33:06,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:06,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 05:33:06,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 05:33:06,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 05:33:06,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:33:06,197 INFO L87 Difference]: Start difference. First operand 793 states and 1079 transitions. Second operand 4 states. [2019-09-08 05:33:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:07,066 INFO L93 Difference]: Finished difference Result 1549 states and 2143 transitions. [2019-09-08 05:33:07,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 05:33:07,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-09-08 05:33:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:07,074 INFO L225 Difference]: With dead ends: 1549 [2019-09-08 05:33:07,074 INFO L226 Difference]: Without dead ends: 792 [2019-09-08 05:33:07,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:33:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-09-08 05:33:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2019-09-08 05:33:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-09-08 05:33:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1069 transitions. [2019-09-08 05:33:07,116 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1069 transitions. Word has length 207 [2019-09-08 05:33:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:07,116 INFO L475 AbstractCegarLoop]: Abstraction has 792 states and 1069 transitions. [2019-09-08 05:33:07,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 05:33:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1069 transitions. [2019-09-08 05:33:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 05:33:07,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:07,123 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:07,124 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:07,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:07,124 INFO L82 PathProgramCache]: Analyzing trace with hash -664610348, now seen corresponding path program 1 times [2019-09-08 05:33:07,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:07,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:07,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:07,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:07,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:33:07,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:07,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:33:07,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:33:07,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:33:07,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:33:07,417 INFO L87 Difference]: Start difference. First operand 792 states and 1069 transitions. Second operand 3 states. [2019-09-08 05:33:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:07,692 INFO L93 Difference]: Finished difference Result 1542 states and 2102 transitions. [2019-09-08 05:33:07,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:33:07,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-08 05:33:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:07,700 INFO L225 Difference]: With dead ends: 1542 [2019-09-08 05:33:07,700 INFO L226 Difference]: Without dead ends: 791 [2019-09-08 05:33:07,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:33:07,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-09-08 05:33:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2019-09-08 05:33:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-09-08 05:33:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1065 transitions. [2019-09-08 05:33:07,755 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1065 transitions. Word has length 225 [2019-09-08 05:33:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:07,755 INFO L475 AbstractCegarLoop]: Abstraction has 791 states and 1065 transitions. [2019-09-08 05:33:07,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:33:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1065 transitions. [2019-09-08 05:33:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 05:33:07,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:07,763 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:07,763 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:07,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:07,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1053060183, now seen corresponding path program 1 times [2019-09-08 05:33:07,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:07,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:07,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:07,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:07,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:33:07,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:07,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 05:33:07,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 05:33:07,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 05:33:07,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:33:07,968 INFO L87 Difference]: Start difference. First operand 791 states and 1065 transitions. Second operand 4 states. [2019-09-08 05:33:08,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:08,693 INFO L93 Difference]: Finished difference Result 1513 states and 2048 transitions. [2019-09-08 05:33:08,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 05:33:08,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-09-08 05:33:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:08,699 INFO L225 Difference]: With dead ends: 1513 [2019-09-08 05:33:08,700 INFO L226 Difference]: Without dead ends: 788 [2019-09-08 05:33:08,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:33:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-08 05:33:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2019-09-08 05:33:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-09-08 05:33:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1048 transitions. [2019-09-08 05:33:08,738 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1048 transitions. Word has length 226 [2019-09-08 05:33:08,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:08,739 INFO L475 AbstractCegarLoop]: Abstraction has 788 states and 1048 transitions. [2019-09-08 05:33:08,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 05:33:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1048 transitions. [2019-09-08 05:33:08,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 05:33:08,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:08,745 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:08,745 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:08,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:08,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1140703033, now seen corresponding path program 1 times [2019-09-08 05:33:08,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:08,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:08,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:08,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:08,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 05:33:08,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:08,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:33:08,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:33:08,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:33:08,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:33:08,974 INFO L87 Difference]: Start difference. First operand 788 states and 1048 transitions. Second operand 3 states. [2019-09-08 05:33:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:09,035 INFO L93 Difference]: Finished difference Result 1229 states and 1615 transitions. [2019-09-08 05:33:09,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:33:09,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-08 05:33:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:09,044 INFO L225 Difference]: With dead ends: 1229 [2019-09-08 05:33:09,044 INFO L226 Difference]: Without dead ends: 791 [2019-09-08 05:33:09,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:33:09,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-09-08 05:33:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 790. [2019-09-08 05:33:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-09-08 05:33:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1050 transitions. [2019-09-08 05:33:09,082 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1050 transitions. Word has length 253 [2019-09-08 05:33:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:09,083 INFO L475 AbstractCegarLoop]: Abstraction has 790 states and 1050 transitions. [2019-09-08 05:33:09,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:33:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1050 transitions. [2019-09-08 05:33:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 05:33:09,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:09,089 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:09,089 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:09,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:09,089 INFO L82 PathProgramCache]: Analyzing trace with hash 548051965, now seen corresponding path program 1 times [2019-09-08 05:33:09,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:09,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:09,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:09,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:09,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 05:33:09,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:09,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:33:09,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:33:09,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:33:09,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:33:09,260 INFO L87 Difference]: Start difference. First operand 790 states and 1050 transitions. Second operand 3 states. [2019-09-08 05:33:09,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:09,309 INFO L93 Difference]: Finished difference Result 1518 states and 2056 transitions. [2019-09-08 05:33:09,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:33:09,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-08 05:33:09,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:09,316 INFO L225 Difference]: With dead ends: 1518 [2019-09-08 05:33:09,316 INFO L226 Difference]: Without dead ends: 845 [2019-09-08 05:33:09,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:33:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-09-08 05:33:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 844. [2019-09-08 05:33:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-08 05:33:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1138 transitions. [2019-09-08 05:33:09,365 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1138 transitions. Word has length 261 [2019-09-08 05:33:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:09,367 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1138 transitions. [2019-09-08 05:33:09,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:33:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1138 transitions. [2019-09-08 05:33:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 05:33:09,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:09,375 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:09,375 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:09,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1285741977, now seen corresponding path program 1 times [2019-09-08 05:33:09,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:09,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:09,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:09,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:09,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:33:09,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:09,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:33:09,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:33:09,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:33:09,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:33:09,772 INFO L87 Difference]: Start difference. First operand 844 states and 1138 transitions. Second operand 11 states. [2019-09-08 05:33:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:19,621 INFO L93 Difference]: Finished difference Result 4616 states and 6640 transitions. [2019-09-08 05:33:19,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 05:33:19,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 262 [2019-09-08 05:33:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:19,649 INFO L225 Difference]: With dead ends: 4616 [2019-09-08 05:33:19,649 INFO L226 Difference]: Without dead ends: 4191 [2019-09-08 05:33:19,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=1007, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 05:33:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2019-09-08 05:33:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 4170. [2019-09-08 05:33:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4170 states. [2019-09-08 05:33:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 5674 transitions. [2019-09-08 05:33:19,893 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 5674 transitions. Word has length 262 [2019-09-08 05:33:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:19,894 INFO L475 AbstractCegarLoop]: Abstraction has 4170 states and 5674 transitions. [2019-09-08 05:33:19,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:33:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5674 transitions. [2019-09-08 05:33:19,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 05:33:19,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:19,903 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:19,903 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:19,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:19,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1735445867, now seen corresponding path program 1 times [2019-09-08 05:33:19,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:19,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:19,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:19,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:19,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:33:20,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:20,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 05:33:20,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:33:20,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:33:20,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:33:20,368 INFO L87 Difference]: Start difference. First operand 4170 states and 5674 transitions. Second operand 22 states. [2019-09-08 05:33:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:21,105 INFO L93 Difference]: Finished difference Result 7667 states and 10406 transitions. [2019-09-08 05:33:21,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 05:33:21,105 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 263 [2019-09-08 05:33:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:21,136 INFO L225 Difference]: With dead ends: 7667 [2019-09-08 05:33:21,137 INFO L226 Difference]: Without dead ends: 4280 [2019-09-08 05:33:21,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:33:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2019-09-08 05:33:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2019-09-08 05:33:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2019-09-08 05:33:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5819 transitions. [2019-09-08 05:33:21,369 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5819 transitions. Word has length 263 [2019-09-08 05:33:21,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:21,370 INFO L475 AbstractCegarLoop]: Abstraction has 4280 states and 5819 transitions. [2019-09-08 05:33:21,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:33:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5819 transitions. [2019-09-08 05:33:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-08 05:33:21,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:21,378 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:21,378 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:21,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:21,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2129296523, now seen corresponding path program 1 times [2019-09-08 05:33:21,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:21,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:21,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:21,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:21,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:33:21,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:21,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 05:33:21,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 05:33:21,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 05:33:21,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 05:33:21,867 INFO L87 Difference]: Start difference. First operand 4280 states and 5819 transitions. Second operand 24 states. [2019-09-08 05:33:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:22,777 INFO L93 Difference]: Finished difference Result 8259 states and 11369 transitions. [2019-09-08 05:33:22,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:33:22,778 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 272 [2019-09-08 05:33:22,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:22,808 INFO L225 Difference]: With dead ends: 8259 [2019-09-08 05:33:22,808 INFO L226 Difference]: Without dead ends: 4481 [2019-09-08 05:33:22,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 05:33:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2019-09-08 05:33:23,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 4481. [2019-09-08 05:33:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4481 states. [2019-09-08 05:33:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4481 states to 4481 states and 6163 transitions. [2019-09-08 05:33:23,038 INFO L78 Accepts]: Start accepts. Automaton has 4481 states and 6163 transitions. Word has length 272 [2019-09-08 05:33:23,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:23,041 INFO L475 AbstractCegarLoop]: Abstraction has 4481 states and 6163 transitions. [2019-09-08 05:33:23,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 05:33:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 4481 states and 6163 transitions. [2019-09-08 05:33:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-08 05:33:23,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:23,049 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:23,049 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:23,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash -948496045, now seen corresponding path program 1 times [2019-09-08 05:33:23,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:23,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:23,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:23,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:23,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:33:23,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:23,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:33:23,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:33:23,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:33:23,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:33:23,283 INFO L87 Difference]: Start difference. First operand 4481 states and 6163 transitions. Second operand 3 states. [2019-09-08 05:33:23,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:23,572 INFO L93 Difference]: Finished difference Result 12756 states and 18477 transitions. [2019-09-08 05:33:23,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:33:23,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 276 [2019-09-08 05:33:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:23,645 INFO L225 Difference]: With dead ends: 12756 [2019-09-08 05:33:23,646 INFO L226 Difference]: Without dead ends: 8321 [2019-09-08 05:33:23,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:33:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8321 states. [2019-09-08 05:33:24,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8321 to 8309. [2019-09-08 05:33:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8309 states. [2019-09-08 05:33:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8309 states to 8309 states and 11728 transitions. [2019-09-08 05:33:24,138 INFO L78 Accepts]: Start accepts. Automaton has 8309 states and 11728 transitions. Word has length 276 [2019-09-08 05:33:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:24,139 INFO L475 AbstractCegarLoop]: Abstraction has 8309 states and 11728 transitions. [2019-09-08 05:33:24,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:33:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 8309 states and 11728 transitions. [2019-09-08 05:33:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-08 05:33:24,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:24,147 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:24,147 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:24,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:24,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1353980626, now seen corresponding path program 1 times [2019-09-08 05:33:24,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:24,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:24,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:24,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:24,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:33:24,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:24,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:33:24,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:33:24,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:33:24,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:33:24,359 INFO L87 Difference]: Start difference. First operand 8309 states and 11728 transitions. Second operand 6 states. [2019-09-08 05:33:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:25,477 INFO L93 Difference]: Finished difference Result 24174 states and 35225 transitions. [2019-09-08 05:33:25,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:33:25,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 272 [2019-09-08 05:33:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:25,572 INFO L225 Difference]: With dead ends: 24174 [2019-09-08 05:33:25,572 INFO L226 Difference]: Without dead ends: 16700 [2019-09-08 05:33:25,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:33:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16700 states. [2019-09-08 05:33:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16700 to 16571. [2019-09-08 05:33:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16571 states. [2019-09-08 05:33:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16571 states to 16571 states and 23687 transitions. [2019-09-08 05:33:26,988 INFO L78 Accepts]: Start accepts. Automaton has 16571 states and 23687 transitions. Word has length 272 [2019-09-08 05:33:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:26,989 INFO L475 AbstractCegarLoop]: Abstraction has 16571 states and 23687 transitions. [2019-09-08 05:33:26,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:33:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 16571 states and 23687 transitions. [2019-09-08 05:33:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 05:33:27,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:27,005 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:27,006 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash -684946487, now seen corresponding path program 1 times [2019-09-08 05:33:27,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:27,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:27,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:27,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:27,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:33:27,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:27,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 05:33:27,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:33:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:33:27,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:33:27,288 INFO L87 Difference]: Start difference. First operand 16571 states and 23687 transitions. Second operand 15 states. [2019-09-08 05:33:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:28,301 INFO L93 Difference]: Finished difference Result 23380 states and 33019 transitions. [2019-09-08 05:33:28,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:33:28,301 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 273 [2019-09-08 05:33:28,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:28,376 INFO L225 Difference]: With dead ends: 23380 [2019-09-08 05:33:28,376 INFO L226 Difference]: Without dead ends: 16679 [2019-09-08 05:33:28,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2019-09-08 05:33:28,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16679 states. [2019-09-08 05:33:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16679 to 16577. [2019-09-08 05:33:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16577 states. [2019-09-08 05:33:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16577 states to 16577 states and 23699 transitions. [2019-09-08 05:33:29,138 INFO L78 Accepts]: Start accepts. Automaton has 16577 states and 23699 transitions. Word has length 273 [2019-09-08 05:33:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:29,138 INFO L475 AbstractCegarLoop]: Abstraction has 16577 states and 23699 transitions. [2019-09-08 05:33:29,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:33:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 16577 states and 23699 transitions. [2019-09-08 05:33:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 05:33:29,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:29,149 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:29,150 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:29,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:29,150 INFO L82 PathProgramCache]: Analyzing trace with hash -98170368, now seen corresponding path program 1 times [2019-09-08 05:33:29,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:29,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:29,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:29,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:29,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:33:29,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:29,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:33:29,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:33:29,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:33:29,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:33:29,374 INFO L87 Difference]: Start difference. First operand 16577 states and 23699 transitions. Second operand 5 states. [2019-09-08 05:33:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:33,012 INFO L93 Difference]: Finished difference Result 63332 states and 95354 transitions. [2019-09-08 05:33:33,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 05:33:33,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 273 [2019-09-08 05:33:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:33,231 INFO L225 Difference]: With dead ends: 63332 [2019-09-08 05:33:33,231 INFO L226 Difference]: Without dead ends: 48231 [2019-09-08 05:33:33,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:33:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48231 states. [2019-09-08 05:33:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48231 to 48041. [2019-09-08 05:33:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48041 states. [2019-09-08 05:33:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48041 states to 48041 states and 70977 transitions. [2019-09-08 05:33:35,157 INFO L78 Accepts]: Start accepts. Automaton has 48041 states and 70977 transitions. Word has length 273 [2019-09-08 05:33:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:35,158 INFO L475 AbstractCegarLoop]: Abstraction has 48041 states and 70977 transitions. [2019-09-08 05:33:35,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:33:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 48041 states and 70977 transitions. [2019-09-08 05:33:35,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-08 05:33:35,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:35,181 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:35,181 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:35,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:35,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1373230701, now seen corresponding path program 1 times [2019-09-08 05:33:35,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:35,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:35,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:35,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:35,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:33:35,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:35,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:33:35,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:33:35,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:33:35,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:33:35,320 INFO L87 Difference]: Start difference. First operand 48041 states and 70977 transitions. Second operand 3 states. [2019-09-08 05:33:38,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:38,135 INFO L93 Difference]: Finished difference Result 115687 states and 186877 transitions. [2019-09-08 05:33:38,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:33:38,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-09-08 05:33:38,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:38,507 INFO L225 Difference]: With dead ends: 115687 [2019-09-08 05:33:38,507 INFO L226 Difference]: Without dead ends: 67590 [2019-09-08 05:33:38,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:33:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67590 states. [2019-09-08 05:33:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67590 to 67563. [2019-09-08 05:33:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67563 states. [2019-09-08 05:33:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67563 states to 67563 states and 100228 transitions. [2019-09-08 05:33:43,326 INFO L78 Accepts]: Start accepts. Automaton has 67563 states and 100228 transitions. Word has length 278 [2019-09-08 05:33:43,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:43,326 INFO L475 AbstractCegarLoop]: Abstraction has 67563 states and 100228 transitions. [2019-09-08 05:33:43,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:33:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 67563 states and 100228 transitions. [2019-09-08 05:33:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-08 05:33:43,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:43,362 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:43,362 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:43,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:43,363 INFO L82 PathProgramCache]: Analyzing trace with hash -840988267, now seen corresponding path program 1 times [2019-09-08 05:33:43,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:43,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:43,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:43,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:43,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:43,779 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:33:43,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:43,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 05:33:43,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 05:33:43,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 05:33:43,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 05:33:43,781 INFO L87 Difference]: Start difference. First operand 67563 states and 100228 transitions. Second operand 24 states. [2019-09-08 05:33:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:46,163 INFO L93 Difference]: Finished difference Result 108044 states and 158124 transitions. [2019-09-08 05:33:46,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:33:46,163 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 279 [2019-09-08 05:33:46,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:46,482 INFO L225 Difference]: With dead ends: 108044 [2019-09-08 05:33:46,482 INFO L226 Difference]: Without dead ends: 68337 [2019-09-08 05:33:46,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 05:33:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68337 states. [2019-09-08 05:33:50,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68337 to 68325. [2019-09-08 05:33:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68325 states. [2019-09-08 05:33:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68325 states to 68325 states and 101232 transitions. [2019-09-08 05:33:50,718 INFO L78 Accepts]: Start accepts. Automaton has 68325 states and 101232 transitions. Word has length 279 [2019-09-08 05:33:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:50,718 INFO L475 AbstractCegarLoop]: Abstraction has 68325 states and 101232 transitions. [2019-09-08 05:33:50,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 05:33:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 68325 states and 101232 transitions. [2019-09-08 05:33:50,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 05:33:50,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:50,740 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:50,740 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:50,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:50,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1641164055, now seen corresponding path program 1 times [2019-09-08 05:33:50,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:50,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:50,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:50,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:50,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:33:51,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:51,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 05:33:51,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:33:51,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:33:51,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:33:51,040 INFO L87 Difference]: Start difference. First operand 68325 states and 101232 transitions. Second operand 17 states. [2019-09-08 05:33:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:53,285 INFO L93 Difference]: Finished difference Result 106876 states and 157799 transitions. [2019-09-08 05:33:53,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 05:33:53,286 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 282 [2019-09-08 05:33:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:53,639 INFO L225 Difference]: With dead ends: 106876 [2019-09-08 05:33:53,640 INFO L226 Difference]: Without dead ends: 68229 [2019-09-08 05:33:53,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:33:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68229 states. [2019-09-08 05:33:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68229 to 68017. [2019-09-08 05:33:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68017 states. [2019-09-08 05:33:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68017 states to 68017 states and 100061 transitions. [2019-09-08 05:33:56,170 INFO L78 Accepts]: Start accepts. Automaton has 68017 states and 100061 transitions. Word has length 282 [2019-09-08 05:33:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:56,171 INFO L475 AbstractCegarLoop]: Abstraction has 68017 states and 100061 transitions. [2019-09-08 05:33:56,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:33:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 68017 states and 100061 transitions. [2019-09-08 05:33:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-08 05:33:56,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:56,197 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:33:56,197 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:56,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:56,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2002505633, now seen corresponding path program 1 times [2019-09-08 05:33:56,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:56,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:56,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:56,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:56,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:33:56,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:56,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 05:33:56,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 05:33:56,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 05:33:56,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-09-08 05:33:56,752 INFO L87 Difference]: Start difference. First operand 68017 states and 100061 transitions. Second operand 26 states. [2019-09-08 05:34:00,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:34:00,676 INFO L93 Difference]: Finished difference Result 111066 states and 166727 transitions. [2019-09-08 05:34:00,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 05:34:00,677 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 288 [2019-09-08 05:34:00,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:34:00,942 INFO L225 Difference]: With dead ends: 111066 [2019-09-08 05:34:00,943 INFO L226 Difference]: Without dead ends: 67297 [2019-09-08 05:34:01,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 05:34:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67297 states. [2019-09-08 05:34:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67297 to 67237. [2019-09-08 05:34:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67237 states. [2019-09-08 05:34:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67237 states to 67237 states and 98381 transitions. [2019-09-08 05:34:03,238 INFO L78 Accepts]: Start accepts. Automaton has 67237 states and 98381 transitions. Word has length 288 [2019-09-08 05:34:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:34:03,239 INFO L475 AbstractCegarLoop]: Abstraction has 67237 states and 98381 transitions. [2019-09-08 05:34:03,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 05:34:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 67237 states and 98381 transitions. [2019-09-08 05:34:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-08 05:34:03,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:34:03,258 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:34:03,259 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:34:03,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:34:03,259 INFO L82 PathProgramCache]: Analyzing trace with hash -320496781, now seen corresponding path program 1 times [2019-09-08 05:34:03,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:34:03,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:34:03,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:03,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:34:03,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:34:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:34:03,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:34:03,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 05:34:03,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:34:03,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:34:03,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:34:03,557 INFO L87 Difference]: Start difference. First operand 67237 states and 98381 transitions. Second operand 17 states. [2019-09-08 05:34:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:34:05,926 INFO L93 Difference]: Finished difference Result 108110 states and 154779 transitions. [2019-09-08 05:34:05,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 05:34:05,927 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 289 [2019-09-08 05:34:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:34:06,179 INFO L225 Difference]: With dead ends: 108110 [2019-09-08 05:34:06,180 INFO L226 Difference]: Without dead ends: 67321 [2019-09-08 05:34:06,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:34:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67321 states. [2019-09-08 05:34:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67321 to 67117. [2019-09-08 05:34:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67117 states. [2019-09-08 05:34:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67117 states to 67117 states and 98203 transitions. [2019-09-08 05:34:10,964 INFO L78 Accepts]: Start accepts. Automaton has 67117 states and 98203 transitions. Word has length 289 [2019-09-08 05:34:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:34:10,965 INFO L475 AbstractCegarLoop]: Abstraction has 67117 states and 98203 transitions. [2019-09-08 05:34:10,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:34:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 67117 states and 98203 transitions. [2019-09-08 05:34:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 05:34:10,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:34:10,981 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:34:10,981 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:34:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:34:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash 80762601, now seen corresponding path program 1 times [2019-09-08 05:34:10,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:34:10,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:34:10,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:10,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:34:10,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:34:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 05:34:11,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:34:11,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:34:11,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:34:11,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:34:11,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:34:11,130 INFO L87 Difference]: Start difference. First operand 67117 states and 98203 transitions. Second operand 3 states. [2019-09-08 05:34:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:34:12,938 INFO L93 Difference]: Finished difference Result 135236 states and 198292 transitions. [2019-09-08 05:34:12,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:34:12,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-08 05:34:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:34:13,145 INFO L225 Difference]: With dead ends: 135236 [2019-09-08 05:34:13,146 INFO L226 Difference]: Without dead ends: 68377 [2019-09-08 05:34:13,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:34:13,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68377 states. [2019-09-08 05:34:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68377 to 68365. [2019-09-08 05:34:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68365 states. [2019-09-08 05:34:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68365 states to 68365 states and 100342 transitions. [2019-09-08 05:34:18,446 INFO L78 Accepts]: Start accepts. Automaton has 68365 states and 100342 transitions. Word has length 302 [2019-09-08 05:34:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:34:18,446 INFO L475 AbstractCegarLoop]: Abstraction has 68365 states and 100342 transitions. [2019-09-08 05:34:18,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:34:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 68365 states and 100342 transitions. [2019-09-08 05:34:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 05:34:18,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:34:18,469 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:34:18,470 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:34:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:34:18,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1468618866, now seen corresponding path program 1 times [2019-09-08 05:34:18,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:34:18,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:34:18,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:18,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:34:18,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:34:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:34:18,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:34:18,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:34:18,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:34:18,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:34:18,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:34:18,637 INFO L87 Difference]: Start difference. First operand 68365 states and 100342 transitions. Second operand 3 states. [2019-09-08 05:34:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:34:20,059 INFO L93 Difference]: Finished difference Result 138884 states and 204589 transitions. [2019-09-08 05:34:20,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:34:20,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-08 05:34:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:34:20,292 INFO L225 Difference]: With dead ends: 138884 [2019-09-08 05:34:20,292 INFO L226 Difference]: Without dead ends: 70777 [2019-09-08 05:34:20,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:34:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70777 states. [2019-09-08 05:34:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70777 to 70765. [2019-09-08 05:34:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70765 states. [2019-09-08 05:34:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70765 states to 70765 states and 104476 transitions. [2019-09-08 05:34:22,942 INFO L78 Accepts]: Start accepts. Automaton has 70765 states and 104476 transitions. Word has length 310 [2019-09-08 05:34:22,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:34:22,943 INFO L475 AbstractCegarLoop]: Abstraction has 70765 states and 104476 transitions. [2019-09-08 05:34:22,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:34:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 70765 states and 104476 transitions. [2019-09-08 05:34:22,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 05:34:22,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:34:22,978 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:34:22,979 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:34:22,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:34:22,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1861927551, now seen corresponding path program 1 times [2019-09-08 05:34:22,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:34:22,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:34:22,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:22,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:34:22,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:34:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:34:23,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:34:23,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 05:34:23,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 05:34:23,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 05:34:23,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:34:23,328 INFO L87 Difference]: Start difference. First operand 70765 states and 104476 transitions. Second operand 19 states. [2019-09-08 05:34:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:34:25,916 INFO L93 Difference]: Finished difference Result 113114 states and 165548 transitions. [2019-09-08 05:34:25,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 05:34:25,917 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 298 [2019-09-08 05:34:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:34:26,149 INFO L225 Difference]: With dead ends: 113114 [2019-09-08 05:34:26,149 INFO L226 Difference]: Without dead ends: 70581 [2019-09-08 05:34:26,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 05:34:26,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70581 states. [2019-09-08 05:34:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70581 to 70425. [2019-09-08 05:34:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70425 states. [2019-09-08 05:34:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70425 states to 70425 states and 103265 transitions. [2019-09-08 05:34:28,715 INFO L78 Accepts]: Start accepts. Automaton has 70425 states and 103265 transitions. Word has length 298 [2019-09-08 05:34:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:34:28,715 INFO L475 AbstractCegarLoop]: Abstraction has 70425 states and 103265 transitions. [2019-09-08 05:34:28,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 05:34:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 70425 states and 103265 transitions. [2019-09-08 05:34:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-08 05:34:28,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:34:28,738 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:34:28,738 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:34:28,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:34:28,738 INFO L82 PathProgramCache]: Analyzing trace with hash -178094010, now seen corresponding path program 1 times [2019-09-08 05:34:28,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:34:28,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:34:28,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:28,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:34:28,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:34:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 05:34:28,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:34:28,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:34:28,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:34:28,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:34:28,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:34:28,950 INFO L87 Difference]: Start difference. First operand 70425 states and 103265 transitions. Second operand 8 states. [2019-09-08 05:34:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:34:39,090 INFO L93 Difference]: Finished difference Result 212247 states and 315625 transitions. [2019-09-08 05:34:39,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:34:39,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 303 [2019-09-08 05:34:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:34:39,590 INFO L225 Difference]: With dead ends: 212247 [2019-09-08 05:34:39,590 INFO L226 Difference]: Without dead ends: 142080 [2019-09-08 05:34:39,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:34:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142080 states. [2019-09-08 05:34:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142080 to 78789. [2019-09-08 05:34:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78789 states. [2019-09-08 05:34:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78789 states to 78789 states and 119021 transitions. [2019-09-08 05:34:47,581 INFO L78 Accepts]: Start accepts. Automaton has 78789 states and 119021 transitions. Word has length 303 [2019-09-08 05:34:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:34:47,582 INFO L475 AbstractCegarLoop]: Abstraction has 78789 states and 119021 transitions. [2019-09-08 05:34:47,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:34:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 78789 states and 119021 transitions. [2019-09-08 05:34:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 05:34:47,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:34:47,637 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:34:47,637 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:34:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:34:47,638 INFO L82 PathProgramCache]: Analyzing trace with hash -430096756, now seen corresponding path program 1 times [2019-09-08 05:34:47,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:34:47,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:34:47,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:47,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:34:47,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:34:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:34:47,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:34:47,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:34:47,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:34:47,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:34:47,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:34:47,839 INFO L87 Difference]: Start difference. First operand 78789 states and 119021 transitions. Second operand 8 states. [2019-09-08 05:34:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:34:58,713 INFO L93 Difference]: Finished difference Result 238947 states and 369637 transitions. [2019-09-08 05:34:58,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:34:58,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 312 [2019-09-08 05:34:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:34:59,254 INFO L225 Difference]: With dead ends: 238947 [2019-09-08 05:34:59,254 INFO L226 Difference]: Without dead ends: 160416 [2019-09-08 05:34:59,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:34:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160416 states. [2019-09-08 05:35:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160416 to 95877. [2019-09-08 05:35:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95877 states. [2019-09-08 05:35:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95877 states to 95877 states and 153053 transitions. [2019-09-08 05:35:04,921 INFO L78 Accepts]: Start accepts. Automaton has 95877 states and 153053 transitions. Word has length 312 [2019-09-08 05:35:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:35:04,921 INFO L475 AbstractCegarLoop]: Abstraction has 95877 states and 153053 transitions. [2019-09-08 05:35:04,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:35:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 95877 states and 153053 transitions. [2019-09-08 05:35:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-08 05:35:05,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:05,041 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-09-08 05:35:05,041 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:05,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:05,042 INFO L82 PathProgramCache]: Analyzing trace with hash 232976450, now seen corresponding path program 1 times [2019-09-08 05:35:05,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:05,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:05,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:05,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 05:35:05,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:05,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:35:05,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:35:05,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:35:05,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:35:05,218 INFO L87 Difference]: Start difference. First operand 95877 states and 153053 transitions. Second operand 8 states. [2019-09-08 05:35:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:35:18,899 INFO L93 Difference]: Finished difference Result 293163 states and 485089 transitions. [2019-09-08 05:35:18,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:35:18,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 305 [2019-09-08 05:35:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:35:20,607 INFO L225 Difference]: With dead ends: 293163 [2019-09-08 05:35:20,607 INFO L226 Difference]: Without dead ends: 197544 [2019-09-08 05:35:20,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:35:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197544 states. [2019-09-08 05:35:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197544 to 130437. [2019-09-08 05:35:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130437 states. [2019-09-08 05:35:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130437 states to 130437 states and 225737 transitions. [2019-09-08 05:35:32,469 INFO L78 Accepts]: Start accepts. Automaton has 130437 states and 225737 transitions. Word has length 305 [2019-09-08 05:35:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:35:32,469 INFO L475 AbstractCegarLoop]: Abstraction has 130437 states and 225737 transitions. [2019-09-08 05:35:32,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:35:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 130437 states and 225737 transitions. [2019-09-08 05:35:32,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 05:35:32,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:32,709 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:35:32,709 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:32,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:32,710 INFO L82 PathProgramCache]: Analyzing trace with hash -324807403, now seen corresponding path program 1 times [2019-09-08 05:35:32,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:32,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:32,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:32,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:32,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-08 05:35:32,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:32,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:35:32,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:35:32,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:35:32,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:35:32,863 INFO L87 Difference]: Start difference. First operand 130437 states and 225737 transitions. Second operand 3 states. [2019-09-08 05:35:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:35:41,173 INFO L93 Difference]: Finished difference Result 297492 states and 532605 transitions. [2019-09-08 05:35:41,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:35:41,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-08 05:35:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:35:42,334 INFO L225 Difference]: With dead ends: 297492 [2019-09-08 05:35:42,335 INFO L226 Difference]: Without dead ends: 167313 [2019-09-08 05:35:42,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:35:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167313 states. [2019-09-08 05:35:53,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167313 to 167301. [2019-09-08 05:35:53,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167301 states. [2019-09-08 05:35:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167301 states to 167301 states and 306377 transitions. [2019-09-08 05:35:54,401 INFO L78 Accepts]: Start accepts. Automaton has 167301 states and 306377 transitions. Word has length 328 [2019-09-08 05:35:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:35:54,402 INFO L475 AbstractCegarLoop]: Abstraction has 167301 states and 306377 transitions. [2019-09-08 05:35:54,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:35:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 167301 states and 306377 transitions. [2019-09-08 05:35:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-08 05:35:54,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:54,857 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:35:54,857 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:54,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:54,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1342014504, now seen corresponding path program 1 times [2019-09-08 05:35:54,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:54,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:54,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:54,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:54,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:35:55,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:55,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:35:55,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:35:55,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:35:55,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:35:55,102 INFO L87 Difference]: Start difference. First operand 167301 states and 306377 transitions. Second operand 6 states. [2019-09-08 05:36:09,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:09,433 INFO L93 Difference]: Finished difference Result 334740 states and 641637 transitions. [2019-09-08 05:36:09,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:36:09,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 319 [2019-09-08 05:36:09,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:10,139 INFO L225 Difference]: With dead ends: 334740 [2019-09-08 05:36:10,139 INFO L226 Difference]: Without dead ends: 167697 [2019-09-08 05:36:10,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:36:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167697 states. [2019-09-08 05:36:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167697 to 167697. [2019-09-08 05:36:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167697 states. [2019-09-08 05:36:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167697 states to 167697 states and 293105 transitions. [2019-09-08 05:36:18,894 INFO L78 Accepts]: Start accepts. Automaton has 167697 states and 293105 transitions. Word has length 319 [2019-09-08 05:36:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:18,894 INFO L475 AbstractCegarLoop]: Abstraction has 167697 states and 293105 transitions. [2019-09-08 05:36:18,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:36:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 167697 states and 293105 transitions. [2019-09-08 05:36:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 05:36:19,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:19,282 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:19,282 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:19,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1949743810, now seen corresponding path program 1 times [2019-09-08 05:36:19,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:19,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:19,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:19,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:19,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-08 05:36:19,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:19,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:36:19,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:36:19,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:36:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:36:19,498 INFO L87 Difference]: Start difference. First operand 167697 states and 293105 transitions. Second operand 6 states. [2019-09-08 05:36:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:30,103 INFO L93 Difference]: Finished difference Result 335340 states and 586992 transitions. [2019-09-08 05:36:30,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:36:30,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 327 [2019-09-08 05:36:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:31,531 INFO L225 Difference]: With dead ends: 335340 [2019-09-08 05:36:31,532 INFO L226 Difference]: Without dead ends: 167937 [2019-09-08 05:36:31,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:36:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167937 states. [2019-09-08 05:36:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167937 to 167925. [2019-09-08 05:36:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167925 states. [2019-09-08 05:36:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167925 states to 167925 states and 293348 transitions. [2019-09-08 05:36:47,043 INFO L78 Accepts]: Start accepts. Automaton has 167925 states and 293348 transitions. Word has length 327 [2019-09-08 05:36:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:47,044 INFO L475 AbstractCegarLoop]: Abstraction has 167925 states and 293348 transitions. [2019-09-08 05:36:47,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:36:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 167925 states and 293348 transitions. [2019-09-08 05:36:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 05:36:47,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:47,486 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:47,486 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1890038431, now seen corresponding path program 1 times [2019-09-08 05:36:47,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:47,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:47,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-08 05:36:48,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:48,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:36:48,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:36:48,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:36:48,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:36:48,425 INFO L87 Difference]: Start difference. First operand 167925 states and 293348 transitions. Second operand 6 states. [2019-09-08 05:37:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:00,198 INFO L93 Difference]: Finished difference Result 335520 states and 590916 transitions. [2019-09-08 05:37:00,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:37:00,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 328 [2019-09-08 05:37:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:01,268 INFO L225 Difference]: With dead ends: 335520 [2019-09-08 05:37:01,268 INFO L226 Difference]: Without dead ends: 167925 [2019-09-08 05:37:01,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:37:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167925 states. [2019-09-08 05:37:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167925 to 167925. [2019-09-08 05:37:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167925 states. [2019-09-08 05:37:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167925 states to 167925 states and 290558 transitions. [2019-09-08 05:37:10,807 INFO L78 Accepts]: Start accepts. Automaton has 167925 states and 290558 transitions. Word has length 328 [2019-09-08 05:37:10,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:10,807 INFO L475 AbstractCegarLoop]: Abstraction has 167925 states and 290558 transitions. [2019-09-08 05:37:10,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:37:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 167925 states and 290558 transitions. [2019-09-08 05:37:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 05:37:11,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:11,234 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:37:11,234 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2104039935, now seen corresponding path program 1 times [2019-09-08 05:37:11,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:11,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:11,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-08 05:37:11,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:11,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 05:37:11,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:37:11,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:37:11,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:37:11,738 INFO L87 Difference]: Start difference. First operand 167925 states and 290558 transitions. Second operand 22 states. [2019-09-08 05:37:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:58,873 INFO L93 Difference]: Finished difference Result 433353 states and 762804 transitions. [2019-09-08 05:37:58,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 05:37:58,873 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 329 [2019-09-08 05:37:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:00,519 INFO L225 Difference]: With dead ends: 433353 [2019-09-08 05:38:00,519 INFO L226 Difference]: Without dead ends: 383412 [2019-09-08 05:38:00,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=661, Invalid=4031, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 05:38:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383412 states. [2019-09-08 05:38:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383412 to 376139. [2019-09-08 05:38:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376139 states. [2019-09-08 05:38:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376139 states to 376139 states and 660011 transitions. [2019-09-08 05:38:33,647 INFO L78 Accepts]: Start accepts. Automaton has 376139 states and 660011 transitions. Word has length 329 [2019-09-08 05:38:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:33,647 INFO L475 AbstractCegarLoop]: Abstraction has 376139 states and 660011 transitions. [2019-09-08 05:38:33,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:38:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 376139 states and 660011 transitions. [2019-09-08 05:38:34,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 05:38:34,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:34,271 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:38:34,271 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:34,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:34,271 INFO L82 PathProgramCache]: Analyzing trace with hash 894308071, now seen corresponding path program 1 times [2019-09-08 05:38:34,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:34,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:34,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:34,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:34,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 05:38:34,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:34,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:38:34,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:38:34,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:38:34,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:38:34,446 INFO L87 Difference]: Start difference. First operand 376139 states and 660011 transitions. Second operand 5 states. [2019-09-08 05:38:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:55,022 INFO L93 Difference]: Finished difference Result 546685 states and 925156 transitions. [2019-09-08 05:38:55,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:38:55,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 320 [2019-09-08 05:38:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:57,556 INFO L225 Difference]: With dead ends: 546685 [2019-09-08 05:38:57,556 INFO L226 Difference]: Without dead ends: 330752 [2019-09-08 05:38:57,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:38:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330752 states. [2019-09-08 05:39:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330752 to 330480. [2019-09-08 05:39:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330480 states. [2019-09-08 05:39:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330480 states to 330480 states and 576721 transitions. [2019-09-08 05:39:26,822 INFO L78 Accepts]: Start accepts. Automaton has 330480 states and 576721 transitions. Word has length 320 [2019-09-08 05:39:26,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:26,822 INFO L475 AbstractCegarLoop]: Abstraction has 330480 states and 576721 transitions. [2019-09-08 05:39:26,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:39:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 330480 states and 576721 transitions. [2019-09-08 05:39:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 05:39:27,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:27,402 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:39:27,402 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:27,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:27,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2071597325, now seen corresponding path program 1 times [2019-09-08 05:39:27,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:27,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:27,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:27,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:27,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 05:39:27,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:27,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:39:27,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:39:27,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:39:27,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:39:27,723 INFO L87 Difference]: Start difference. First operand 330480 states and 576721 transitions. Second operand 18 states. [2019-09-08 05:40:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:08,017 INFO L93 Difference]: Finished difference Result 466544 states and 818761 transitions. [2019-09-08 05:40:08,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 05:40:08,017 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 321 [2019-09-08 05:40:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:09,388 INFO L225 Difference]: With dead ends: 466544 [2019-09-08 05:40:09,388 INFO L226 Difference]: Without dead ends: 342559 [2019-09-08 05:40:09,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 05:40:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342559 states. [2019-09-08 05:40:41,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342559 to 338054. [2019-09-08 05:40:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338054 states. [2019-09-08 05:40:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338054 states to 338054 states and 596926 transitions. [2019-09-08 05:40:44,010 INFO L78 Accepts]: Start accepts. Automaton has 338054 states and 596926 transitions. Word has length 321 [2019-09-08 05:40:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:44,011 INFO L475 AbstractCegarLoop]: Abstraction has 338054 states and 596926 transitions. [2019-09-08 05:40:44,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:40:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 338054 states and 596926 transitions. [2019-09-08 05:40:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 05:40:44,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:44,691 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:40:44,691 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:44,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:44,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1448101899, now seen corresponding path program 1 times [2019-09-08 05:40:44,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:44,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:44,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:44,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:44,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 05:40:45,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:45,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 05:40:45,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:40:45,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:40:45,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:40:45,115 INFO L87 Difference]: Start difference. First operand 338054 states and 596926 transitions. Second operand 20 states. [2019-09-08 05:41:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:05,882 INFO L93 Difference]: Finished difference Result 440369 states and 750546 transitions. [2019-09-08 05:41:05,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 05:41:05,883 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 313 [2019-09-08 05:41:05,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:07,385 INFO L225 Difference]: With dead ends: 440369 [2019-09-08 05:41:07,385 INFO L226 Difference]: Without dead ends: 338314 [2019-09-08 05:41:07,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-09-08 05:41:07,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338314 states. [2019-09-08 05:41:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338314 to 338026. [2019-09-08 05:41:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338026 states. [2019-09-08 05:41:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338026 states to 338026 states and 596602 transitions. [2019-09-08 05:41:38,036 INFO L78 Accepts]: Start accepts. Automaton has 338026 states and 596602 transitions. Word has length 313 [2019-09-08 05:41:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:38,037 INFO L475 AbstractCegarLoop]: Abstraction has 338026 states and 596602 transitions. [2019-09-08 05:41:38,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:41:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 338026 states and 596602 transitions. [2019-09-08 05:41:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 05:41:39,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:39,785 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:39,786 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:39,786 INFO L82 PathProgramCache]: Analyzing trace with hash -597582641, now seen corresponding path program 1 times [2019-09-08 05:41:39,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:39,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:39,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:39,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:39,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:41:39,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:39,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:41:39,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:41:39,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:41:39,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:41:39,973 INFO L87 Difference]: Start difference. First operand 338026 states and 596602 transitions. Second operand 5 states. [2019-09-08 05:42:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:00,361 INFO L93 Difference]: Finished difference Result 429504 states and 754710 transitions. [2019-09-08 05:42:00,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:42:00,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 313 [2019-09-08 05:42:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:02,570 INFO L225 Difference]: With dead ends: 429504 [2019-09-08 05:42:02,570 INFO L226 Difference]: Without dead ends: 341940 [2019-09-08 05:42:02,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:42:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341940 states. [2019-09-08 05:42:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341940 to 339237. [2019-09-08 05:42:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339237 states. [2019-09-08 05:42:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339237 states to 339237 states and 596737 transitions. [2019-09-08 05:42:33,274 INFO L78 Accepts]: Start accepts. Automaton has 339237 states and 596737 transitions. Word has length 313 [2019-09-08 05:42:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:33,275 INFO L475 AbstractCegarLoop]: Abstraction has 339237 states and 596737 transitions. [2019-09-08 05:42:33,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:42:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 339237 states and 596737 transitions. [2019-09-08 05:42:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 05:42:33,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:33,834 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:42:33,834 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:33,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:33,835 INFO L82 PathProgramCache]: Analyzing trace with hash 181878023, now seen corresponding path program 1 times [2019-09-08 05:42:33,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:33,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:33,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:33,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:33,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:42:34,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:42:34,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:42:34,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:42:34,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:42:34,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:42:34,230 INFO L87 Difference]: Start difference. First operand 339237 states and 596737 transitions. Second operand 18 states. [2019-09-08 05:43:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:43:10,095 INFO L93 Difference]: Finished difference Result 451854 states and 791164 transitions. [2019-09-08 05:43:10,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 05:43:10,095 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 312 [2019-09-08 05:43:10,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:43:11,435 INFO L225 Difference]: With dead ends: 451854 [2019-09-08 05:43:11,435 INFO L226 Difference]: Without dead ends: 343470 [2019-09-08 05:43:11,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 05:43:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343470 states.