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_spec8_product34.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:47:46,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:47:46,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:47:46,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:47:46,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:47:46,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:47:46,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:47:46,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:47:46,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:47:46,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:47:46,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:47:46,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:47:46,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:47:46,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:47:46,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:47:46,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:47:46,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:47:46,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:47:46,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:47:46,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:47:46,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:47:46,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:47:46,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:47:46,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:47:46,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:47:46,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:47:46,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:47:46,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:47:46,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:47:46,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:47:46,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:47:46,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:47:46,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:47:46,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:47:46,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:47:46,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:47:46,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:47:46,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:47:46,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:47:46,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:47:46,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:47:46,423 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:47:46,438 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:47:46,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:47:46,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:47:46,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:47:46,440 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:47:46,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:47:46,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:47:46,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:47:46,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:47:46,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:47:46,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:47:46,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:47:46,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:47:46,442 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:47:46,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:47:46,442 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:47:46,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:47:46,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:47:46,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:47:46,443 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:47:46,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:47:46,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:47:46,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:47:46,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:47:46,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:47:46,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:47:46,444 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:47:46,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:47:46,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:47:46,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:47:46,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:47:46,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:47:46,493 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:47:46,494 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:47:46,494 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product34.cil.c [2019-09-08 05:47:46,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c528d42f/0fcf95eeccfc4933aae62879c7e1f324/FLAG1713fc6d1 [2019-09-08 05:47:47,269 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:47:47,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product34.cil.c [2019-09-08 05:47:47,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c528d42f/0fcf95eeccfc4933aae62879c7e1f324/FLAG1713fc6d1 [2019-09-08 05:47:47,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c528d42f/0fcf95eeccfc4933aae62879c7e1f324 [2019-09-08 05:47:47,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:47:47,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:47:47,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:47:47,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:47:47,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:47:47,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:47:47" (1/1) ... [2019-09-08 05:47:47,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ffcf0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:47:47, skipping insertion in model container [2019-09-08 05:47:47,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:47:47" (1/1) ... [2019-09-08 05:47:47,483 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:47:47,562 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:47:48,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:47:48,320 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:47:48,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:47:48,604 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:47:48,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:47:48 WrapperNode [2019-09-08 05:47:48,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:47:48,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:47:48,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:47:48,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:47:48,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:47:48" (1/1) ... [2019-09-08 05:47:48,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:47:48" (1/1) ... [2019-09-08 05:47:48,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:47:48" (1/1) ... [2019-09-08 05:47:48,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:47:48" (1/1) ... [2019-09-08 05:47:48,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:47:48" (1/1) ... [2019-09-08 05:47:48,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:47:48" (1/1) ... [2019-09-08 05:47:48,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:47:48" (1/1) ... [2019-09-08 05:47:48,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:47:48,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:47:48,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:47:48,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:47:48,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:47:48" (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:47:48,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:47:48,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:47:48,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:47:48,885 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:47:48,886 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:47:48,886 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:47:48,887 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:47:48,887 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:47:48,888 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:47:48,888 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:47:48,888 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:47:48,888 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:47:48,889 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:47:48,889 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:47:48,890 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:47:48,890 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:47:48,893 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:47:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:47:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:47:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:47:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:47:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:47:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:47:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:47:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:47:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:47:48,896 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:47:48,896 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:47:48,896 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:47:48,896 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:47:48,896 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:47:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:47:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:47:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:47:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:47:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:47:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:47:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:47:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:47:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:47:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:47:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:47:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:47:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:47:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:47:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:47:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:47:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:47:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:47:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:47:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:47:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:47:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:47:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:47:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:47:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:47:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:47:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:47:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:47:48,902 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:47:48,902 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:47:48,902 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:47:48,902 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:47:48,902 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:47:48,902 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:47:48,902 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:47:48,903 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:47:48,903 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:47:48,904 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:47:48,904 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-08 05:47:48,904 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 05:47:48,904 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:47:48,904 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:47:48,904 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:47:48,905 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 05:47:48,905 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:47:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:47:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:47:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:47:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:47:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:47:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:47:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:47:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:47:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:47:48,908 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:47:48,908 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:47:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:47:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:47:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:47:48,910 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:47:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:47:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:47:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:47:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:47:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:47:48,912 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:47:48,912 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:47:48,912 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:47:48,912 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:47:48,912 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:47:48,912 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:47:48,913 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:47:48,913 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:47:48,913 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:47:48,913 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:47:48,913 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:47:48,913 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:47:48,914 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:47:48,914 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:47:48,914 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:47:48,914 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:47:48,914 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 05:47:48,914 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 05:47:48,915 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:47:48,915 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:47:48,915 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:47:48,915 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:47:48,916 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:47:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:47:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:47:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:47:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:47:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:47:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:47:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:47:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:47:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:47:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:47:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:47:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:47:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:47:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:47:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:47:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:47:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:47:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:47:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:47:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:47:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:47:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:47:48,927 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:47:48,927 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:47:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:47:48,937 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:47:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:47:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:47:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:47:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:47:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:47:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:47:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:47:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:47:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:47:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:47:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:47:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:47:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:47:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:47:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:47:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:47:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:47:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:47:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:47:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:47:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:47:48,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:47:48,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:47:48,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:47:48,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:47:48,942 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:47:48,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:47:48,943 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:47:48,943 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:47:48,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:47:48,943 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:47:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:47:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:47:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:47:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:47:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:47:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:47:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:47:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:47:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:47:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:47:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:47:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:47:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:47:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:47:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:47:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:47:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:47:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:47:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:47:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:47:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:47:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:47:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:47:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:47:48,948 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:47:48,948 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:47:48,948 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:47:48,948 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:47:48,948 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:47:48,948 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:47:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:47:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:47:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:47:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:47:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:47:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:47:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:47:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:47:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:47:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:47:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:47:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:47:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:47:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:47:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:47:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:47:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:47:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:47:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:47:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:47:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:47:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:47:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:47:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:47:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:47:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:47:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-08 05:47:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 05:47:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:47:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 05:47:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:47:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:47:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:47:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:47:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:47:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:47:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:47:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:47:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:47:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:47:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:47:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 05:47:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 05:47:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:47:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:47:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:47:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:47:51,188 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:47:51,189 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:47:51,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:47:51 BoogieIcfgContainer [2019-09-08 05:47:51,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:47:51,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:47:51,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:47:51,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:47:51,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:47:47" (1/3) ... [2019-09-08 05:47:51,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794b2f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:47:51, skipping insertion in model container [2019-09-08 05:47:51,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:47:48" (2/3) ... [2019-09-08 05:47:51,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794b2f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:47:51, skipping insertion in model container [2019-09-08 05:47:51,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:47:51" (3/3) ... [2019-09-08 05:47:51,200 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product34.cil.c [2019-09-08 05:47:51,212 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:47:51,230 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:47:51,250 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:47:51,299 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:47:51,300 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:47:51,300 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:47:51,304 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:47:51,304 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:47:51,304 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:47:51,305 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:47:51,305 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:47:51,305 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:47:51,351 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states. [2019-09-08 05:47:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 05:47:51,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:51,375 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-08 05:47:51,379 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:51,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:51,386 INFO L82 PathProgramCache]: Analyzing trace with hash -794584526, now seen corresponding path program 1 times [2019-09-08 05:47:51,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:51,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:51,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:51,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:51,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:47:52,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:47:52,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:47:52,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:47:52,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:47:52,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:47:52,120 INFO L87 Difference]: Start difference. First operand 655 states. Second operand 2 states. [2019-09-08 05:47:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:52,240 INFO L93 Difference]: Finished difference Result 996 states and 1339 transitions. [2019-09-08 05:47:52,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:47:52,242 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 167 [2019-09-08 05:47:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:52,277 INFO L225 Difference]: With dead ends: 996 [2019-09-08 05:47:52,277 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 05:47:52,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:47:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 05:47:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 05:47:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 05:47:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 848 transitions. [2019-09-08 05:47:52,429 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 848 transitions. Word has length 167 [2019-09-08 05:47:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:52,432 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 848 transitions. [2019-09-08 05:47:52,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:47:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 848 transitions. [2019-09-08 05:47:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 05:47:52,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:52,443 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-08 05:47:52,444 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:52,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:52,444 INFO L82 PathProgramCache]: Analyzing trace with hash -54617500, now seen corresponding path program 1 times [2019-09-08 05:47:52,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:52,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:52,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:52,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:52,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:47:52,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:47:52,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:47:52,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:47:52,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:47:52,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:47:52,720 INFO L87 Difference]: Start difference. First operand 626 states and 848 transitions. Second operand 3 states. [2019-09-08 05:47:52,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:52,805 INFO L93 Difference]: Finished difference Result 979 states and 1304 transitions. [2019-09-08 05:47:52,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:47:52,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 05:47:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:52,818 INFO L225 Difference]: With dead ends: 979 [2019-09-08 05:47:52,819 INFO L226 Difference]: Without dead ends: 629 [2019-09-08 05:47:52,821 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:47:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-08 05:47:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 628. [2019-09-08 05:47:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 05:47:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 850 transitions. [2019-09-08 05:47:52,868 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 850 transitions. Word has length 168 [2019-09-08 05:47:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:52,870 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 850 transitions. [2019-09-08 05:47:52,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:47:52,870 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 850 transitions. [2019-09-08 05:47:52,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 05:47:52,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:52,878 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:47:52,878 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:52,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:52,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1390838960, now seen corresponding path program 1 times [2019-09-08 05:47:52,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:52,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:52,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:52,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:52,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:47:53,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:47:53,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:47:53,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:47:53,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:47:53,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:47:53,138 INFO L87 Difference]: Start difference. First operand 628 states and 850 transitions. Second operand 3 states. [2019-09-08 05:47:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:53,184 INFO L93 Difference]: Finished difference Result 1234 states and 1701 transitions. [2019-09-08 05:47:53,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:47:53,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 05:47:53,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:53,196 INFO L225 Difference]: With dead ends: 1234 [2019-09-08 05:47:53,197 INFO L226 Difference]: Without dead ends: 671 [2019-09-08 05:47:53,199 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:47:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-09-08 05:47:53,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 670. [2019-09-08 05:47:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-08 05:47:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 922 transitions. [2019-09-08 05:47:53,234 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 922 transitions. Word has length 174 [2019-09-08 05:47:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:53,235 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 922 transitions. [2019-09-08 05:47:53,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:47:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 922 transitions. [2019-09-08 05:47:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 05:47:53,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:53,242 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:47:53,242 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:53,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash -557359296, now seen corresponding path program 1 times [2019-09-08 05:47:53,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:53,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:53,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:53,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:53,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:47:53,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:47:53,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:47:53,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:47:53,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:47:53,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:47:53,548 INFO L87 Difference]: Start difference. First operand 670 states and 922 transitions. Second operand 3 states. [2019-09-08 05:47:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:53,594 INFO L93 Difference]: Finished difference Result 1148 states and 1566 transitions. [2019-09-08 05:47:53,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:47:53,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 05:47:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:53,602 INFO L225 Difference]: With dead ends: 1148 [2019-09-08 05:47:53,602 INFO L226 Difference]: Without dead ends: 811 [2019-09-08 05:47:53,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:47:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-09-08 05:47:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 810. [2019-09-08 05:47:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2019-09-08 05:47:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1119 transitions. [2019-09-08 05:47:53,649 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1119 transitions. Word has length 175 [2019-09-08 05:47:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:53,649 INFO L475 AbstractCegarLoop]: Abstraction has 810 states and 1119 transitions. [2019-09-08 05:47:53,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:47:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1119 transitions. [2019-09-08 05:47:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 05:47:53,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:53,657 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:47:53,657 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:53,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:53,658 INFO L82 PathProgramCache]: Analyzing trace with hash -203609441, now seen corresponding path program 1 times [2019-09-08 05:47:53,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:53,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:53,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:53,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:53,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:47:54,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:47:54,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:47:54,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:47:54,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:47:54,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:47:54,146 INFO L87 Difference]: Start difference. First operand 810 states and 1119 transitions. Second operand 6 states. [2019-09-08 05:47:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:55,103 INFO L93 Difference]: Finished difference Result 2010 states and 2769 transitions. [2019-09-08 05:47:55,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:47:55,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 320 [2019-09-08 05:47:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:55,115 INFO L225 Difference]: With dead ends: 2010 [2019-09-08 05:47:55,115 INFO L226 Difference]: Without dead ends: 1571 [2019-09-08 05:47:55,118 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:47:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2019-09-08 05:47:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1560. [2019-09-08 05:47:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-08 05:47:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2174 transitions. [2019-09-08 05:47:55,205 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2174 transitions. Word has length 320 [2019-09-08 05:47:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:55,207 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2174 transitions. [2019-09-08 05:47:55,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:47:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2174 transitions. [2019-09-08 05:47:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 05:47:55,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:55,216 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:47:55,217 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:55,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:55,217 INFO L82 PathProgramCache]: Analyzing trace with hash 72654355, now seen corresponding path program 1 times [2019-09-08 05:47:55,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:55,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:55,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:55,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:55,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:47:55,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:47:55,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:47:55,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:47:55,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:47:55,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:47:55,687 INFO L87 Difference]: Start difference. First operand 1560 states and 2174 transitions. Second operand 11 states. [2019-09-08 05:47:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:56,343 INFO L93 Difference]: Finished difference Result 2435 states and 3327 transitions. [2019-09-08 05:47:56,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:47:56,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 321 [2019-09-08 05:47:56,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:56,362 INFO L225 Difference]: With dead ends: 2435 [2019-09-08 05:47:56,363 INFO L226 Difference]: Without dead ends: 1534 [2019-09-08 05:47:56,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:47:56,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2019-09-08 05:47:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1530. [2019-09-08 05:47:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1530 states. [2019-09-08 05:47:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2123 transitions. [2019-09-08 05:47:56,472 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2123 transitions. Word has length 321 [2019-09-08 05:47:56,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:56,473 INFO L475 AbstractCegarLoop]: Abstraction has 1530 states and 2123 transitions. [2019-09-08 05:47:56,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:47:56,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2123 transitions. [2019-09-08 05:47:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 05:47:56,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:56,484 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:47:56,484 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:56,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:56,485 INFO L82 PathProgramCache]: Analyzing trace with hash 299496427, now seen corresponding path program 1 times [2019-09-08 05:47:56,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:56,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:56,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:56,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:56,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 05:47:57,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:47:57,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:47:57,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:57,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 3856 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:47:57,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:47:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:47:58,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:47:58,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-09-08 05:47:58,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 05:47:58,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 05:47:58,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:47:58,259 INFO L87 Difference]: Start difference. First operand 1530 states and 2123 transitions. Second operand 29 states. [2019-09-08 05:48:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:50,147 INFO L93 Difference]: Finished difference Result 10302 states and 14790 transitions. [2019-09-08 05:48:50,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-08 05:48:50,148 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 329 [2019-09-08 05:48:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:50,212 INFO L225 Difference]: With dead ends: 10302 [2019-09-08 05:48:50,212 INFO L226 Difference]: Without dead ends: 8571 [2019-09-08 05:48:50,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10469 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2054, Invalid=28048, Unknown=0, NotChecked=0, Total=30102 [2019-09-08 05:48:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8571 states. [2019-09-08 05:48:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8571 to 8141. [2019-09-08 05:48:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8141 states. [2019-09-08 05:48:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8141 states to 8141 states and 11505 transitions. [2019-09-08 05:48:50,739 INFO L78 Accepts]: Start accepts. Automaton has 8141 states and 11505 transitions. Word has length 329 [2019-09-08 05:48:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:50,739 INFO L475 AbstractCegarLoop]: Abstraction has 8141 states and 11505 transitions. [2019-09-08 05:48:50,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 05:48:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 8141 states and 11505 transitions. [2019-09-08 05:48:50,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 05:48:50,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:50,790 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:48:50,791 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:50,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:50,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1973229506, now seen corresponding path program 1 times [2019-09-08 05:48:50,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:50,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:50,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:50,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:50,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 05:48:51,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:51,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:48:51,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:48:51,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:48:51,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:48:51,175 INFO L87 Difference]: Start difference. First operand 8141 states and 11505 transitions. Second operand 5 states. [2019-09-08 05:48:51,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:51,943 INFO L93 Difference]: Finished difference Result 14621 states and 20458 transitions. [2019-09-08 05:48:51,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:48:51,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 336 [2019-09-08 05:48:51,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:51,997 INFO L225 Difference]: With dead ends: 14621 [2019-09-08 05:48:51,997 INFO L226 Difference]: Without dead ends: 7581 [2019-09-08 05:48:52,028 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:48:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-09-08 05:48:52,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7491. [2019-09-08 05:48:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7491 states. [2019-09-08 05:48:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7491 states to 7491 states and 10564 transitions. [2019-09-08 05:48:52,489 INFO L78 Accepts]: Start accepts. Automaton has 7491 states and 10564 transitions. Word has length 336 [2019-09-08 05:48:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:52,492 INFO L475 AbstractCegarLoop]: Abstraction has 7491 states and 10564 transitions. [2019-09-08 05:48:52,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:48:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 7491 states and 10564 transitions. [2019-09-08 05:48:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 05:48:52,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:52,518 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:48:52,519 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:52,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash 561728150, now seen corresponding path program 1 times [2019-09-08 05:48:52,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:52,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:52,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:52,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:52,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-08 05:48:52,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:48:52,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:48:52,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:53,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 3860 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:48:53,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:48:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-08 05:48:53,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:48:53,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-09-08 05:48:53,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:48:53,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:48:53,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:48:53,692 INFO L87 Difference]: Start difference. First operand 7491 states and 10564 transitions. Second operand 23 states. [2019-09-08 05:48:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:56,502 INFO L93 Difference]: Finished difference Result 15629 states and 22731 transitions. [2019-09-08 05:48:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 05:48:56,502 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 333 [2019-09-08 05:48:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:56,563 INFO L225 Difference]: With dead ends: 15629 [2019-09-08 05:48:56,563 INFO L226 Difference]: Without dead ends: 8003 [2019-09-08 05:48:56,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=1825, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 05:48:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8003 states. [2019-09-08 05:48:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8003 to 7961. [2019-09-08 05:48:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2019-09-08 05:48:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 11342 transitions. [2019-09-08 05:48:57,070 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 11342 transitions. Word has length 333 [2019-09-08 05:48:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:57,070 INFO L475 AbstractCegarLoop]: Abstraction has 7961 states and 11342 transitions. [2019-09-08 05:48:57,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:48:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 11342 transitions. [2019-09-08 05:48:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 05:48:57,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:57,097 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:48:57,097 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:57,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:57,098 INFO L82 PathProgramCache]: Analyzing trace with hash 90282552, now seen corresponding path program 1 times [2019-09-08 05:48:57,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:57,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:57,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:57,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:57,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 05:48:57,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:48:57,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:48:57,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:58,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 3860 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:48:58,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:48:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:48:58,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:48:58,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-09-08 05:48:58,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:48:58,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:48:58,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:48:58,507 INFO L87 Difference]: Start difference. First operand 7961 states and 11342 transitions. Second operand 25 states. [2019-09-08 05:49:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:49:43,634 INFO L93 Difference]: Finished difference Result 23886 states and 34442 transitions. [2019-09-08 05:49:43,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 05:49:43,634 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 333 [2019-09-08 05:49:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:49:43,699 INFO L225 Difference]: With dead ends: 23886 [2019-09-08 05:49:43,699 INFO L226 Difference]: Without dead ends: 13213 [2019-09-08 05:49:43,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9617 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-09-08 05:49:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13213 states. [2019-09-08 05:49:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13213 to 11867. [2019-09-08 05:49:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11867 states. [2019-09-08 05:49:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 16944 transitions. [2019-09-08 05:49:44,418 INFO L78 Accepts]: Start accepts. Automaton has 11867 states and 16944 transitions. Word has length 333 [2019-09-08 05:49:44,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:49:44,419 INFO L475 AbstractCegarLoop]: Abstraction has 11867 states and 16944 transitions. [2019-09-08 05:49:44,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:49:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 11867 states and 16944 transitions. [2019-09-08 05:49:44,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 05:49:44,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:49:44,451 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:49:44,451 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:49:44,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:49:44,452 INFO L82 PathProgramCache]: Analyzing trace with hash 470741268, now seen corresponding path program 1 times [2019-09-08 05:49:44,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:49:44,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:49:44,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:44,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:49:44,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:49:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 05:49:44,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:49:44,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:49:44,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:49:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:49:45,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 3861 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:49:45,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:49:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:49:45,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:49:45,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-09-08 05:49:45,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:49:45,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:49:45,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:49:45,989 INFO L87 Difference]: Start difference. First operand 11867 states and 16944 transitions. Second operand 25 states. [2019-09-08 05:50:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:50:30,147 INFO L93 Difference]: Finished difference Result 33331 states and 48086 transitions. [2019-09-08 05:50:30,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 05:50:30,147 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 334 [2019-09-08 05:50:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:50:30,230 INFO L225 Difference]: With dead ends: 33331 [2019-09-08 05:50:30,231 INFO L226 Difference]: Without dead ends: 17335 [2019-09-08 05:50:30,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9625 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-09-08 05:50:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17335 states. [2019-09-08 05:50:31,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17335 to 15192. [2019-09-08 05:50:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15192 states. [2019-09-08 05:50:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15192 states to 15192 states and 21691 transitions. [2019-09-08 05:50:31,362 INFO L78 Accepts]: Start accepts. Automaton has 15192 states and 21691 transitions. Word has length 334 [2019-09-08 05:50:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:50:31,362 INFO L475 AbstractCegarLoop]: Abstraction has 15192 states and 21691 transitions. [2019-09-08 05:50:31,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:50:31,363 INFO L276 IsEmpty]: Start isEmpty. Operand 15192 states and 21691 transitions. [2019-09-08 05:50:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 05:50:31,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:50:31,393 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:50:31,393 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:50:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:50:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash -894423766, now seen corresponding path program 1 times [2019-09-08 05:50:31,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:50:31,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:50:31,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:31,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:50:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:50:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 05:50:31,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:50:31,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:50:31,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:50:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:50:32,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 3862 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:50:32,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:50:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:50:32,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:50:32,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 05:50:32,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 05:50:32,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 05:50:32,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:50:32,449 INFO L87 Difference]: Start difference. First operand 15192 states and 21691 transitions. Second operand 14 states. [2019-09-08 05:50:45,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:50:45,410 INFO L93 Difference]: Finished difference Result 65196 states and 114387 transitions. [2019-09-08 05:50:45,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 05:50:45,411 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 336 [2019-09-08 05:50:45,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:50:45,753 INFO L225 Difference]: With dead ends: 65196 [2019-09-08 05:50:45,753 INFO L226 Difference]: Without dead ends: 50084 [2019-09-08 05:50:45,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 05:50:45,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50084 states. [2019-09-08 05:50:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50084 to 47730. [2019-09-08 05:50:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47730 states. [2019-09-08 05:50:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47730 states to 47730 states and 82079 transitions. [2019-09-08 05:50:50,439 INFO L78 Accepts]: Start accepts. Automaton has 47730 states and 82079 transitions. Word has length 336 [2019-09-08 05:50:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:50:50,440 INFO L475 AbstractCegarLoop]: Abstraction has 47730 states and 82079 transitions. [2019-09-08 05:50:50,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 05:50:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 47730 states and 82079 transitions. [2019-09-08 05:50:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 05:50:50,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:50:50,501 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:50:50,501 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:50:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:50:50,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1064672536, now seen corresponding path program 1 times [2019-09-08 05:50:50,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:50:50,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:50:50,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:50,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:50:50,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:50:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:50:51,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:50:51,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:50:51,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:50:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:50:51,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 3865 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:50:51,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:50:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:50:51,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:50:51,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [26] total 31 [2019-09-08 05:50:51,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 05:50:51,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 05:50:51,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:50:51,999 INFO L87 Difference]: Start difference. First operand 47730 states and 82079 transitions. Second operand 31 states. [2019-09-08 05:50:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:50:58,779 INFO L93 Difference]: Finished difference Result 109360 states and 237547 transitions. [2019-09-08 05:50:58,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 05:50:58,780 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 339 [2019-09-08 05:50:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:50:59,268 INFO L225 Difference]: With dead ends: 109360 [2019-09-08 05:50:59,268 INFO L226 Difference]: Without dead ends: 57117 [2019-09-08 05:50:59,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=231, Invalid=3929, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 05:50:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57117 states. [2019-09-08 05:51:04,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57117 to 54232. [2019-09-08 05:51:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54232 states. [2019-09-08 05:51:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54232 states to 54232 states and 97382 transitions. [2019-09-08 05:51:04,999 INFO L78 Accepts]: Start accepts. Automaton has 54232 states and 97382 transitions. Word has length 339 [2019-09-08 05:51:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:51:05,000 INFO L475 AbstractCegarLoop]: Abstraction has 54232 states and 97382 transitions. [2019-09-08 05:51:05,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 05:51:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 54232 states and 97382 transitions. [2019-09-08 05:51:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-08 05:51:05,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:51:05,059 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:51:05,059 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:51:05,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:51:05,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1632539055, now seen corresponding path program 1 times [2019-09-08 05:51:05,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:51:05,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:51:05,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:05,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:51:05,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:51:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 05:51:05,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:51:05,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:51:05,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:51:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:51:05,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:51:05,315 INFO L87 Difference]: Start difference. First operand 54232 states and 97382 transitions. Second operand 10 states. [2019-09-08 05:51:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:51:07,719 INFO L93 Difference]: Finished difference Result 107062 states and 214599 transitions. [2019-09-08 05:51:07,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:51:07,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 342 [2019-09-08 05:51:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:51:08,113 INFO L225 Difference]: With dead ends: 107062 [2019-09-08 05:51:08,113 INFO L226 Difference]: Without dead ends: 55636 [2019-09-08 05:51:08,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:51:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55636 states. [2019-09-08 05:51:13,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55636 to 54508. [2019-09-08 05:51:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54508 states. [2019-09-08 05:51:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54508 states to 54508 states and 97767 transitions. [2019-09-08 05:51:13,759 INFO L78 Accepts]: Start accepts. Automaton has 54508 states and 97767 transitions. Word has length 342 [2019-09-08 05:51:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:51:13,760 INFO L475 AbstractCegarLoop]: Abstraction has 54508 states and 97767 transitions. [2019-09-08 05:51:13,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:51:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 54508 states and 97767 transitions. [2019-09-08 05:51:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-08 05:51:13,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:51:13,805 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:51:13,805 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:51:13,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:51:13,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1354572965, now seen corresponding path program 1 times [2019-09-08 05:51:13,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:51:13,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:51:13,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:13,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:51:13,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:51:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 05:51:14,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:51:14,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:51:14,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:51:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:51:14,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 4052 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:51:14,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:51:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:51:14,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:51:14,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-09-08 05:51:14,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:51:14,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:51:14,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:51:14,862 INFO L87 Difference]: Start difference. First operand 54508 states and 97767 transitions. Second operand 9 states. [2019-09-08 05:51:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:51:21,706 INFO L93 Difference]: Finished difference Result 182680 states and 338826 transitions. [2019-09-08 05:51:21,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:51:21,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 389 [2019-09-08 05:51:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:51:22,374 INFO L225 Difference]: With dead ends: 182680 [2019-09-08 05:51:22,374 INFO L226 Difference]: Without dead ends: 126413 [2019-09-08 05:51:22,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:51:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126413 states. [2019-09-08 05:51:28,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126413 to 120892. [2019-09-08 05:51:28,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120892 states. [2019-09-08 05:51:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120892 states to 120892 states and 220918 transitions. [2019-09-08 05:51:29,298 INFO L78 Accepts]: Start accepts. Automaton has 120892 states and 220918 transitions. Word has length 389 [2019-09-08 05:51:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:51:29,298 INFO L475 AbstractCegarLoop]: Abstraction has 120892 states and 220918 transitions. [2019-09-08 05:51:29,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:51:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 120892 states and 220918 transitions. [2019-09-08 05:51:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-08 05:51:29,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:51:29,357 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:51:29,357 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:51:29,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:51:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1139565972, now seen corresponding path program 1 times [2019-09-08 05:51:29,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:51:29,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:51:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:29,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:51:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:51:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 05:51:30,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:51:30,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:51:30,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:51:30,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:51:30,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:51:30,489 INFO L87 Difference]: Start difference. First operand 120892 states and 220918 transitions. Second operand 3 states. [2019-09-08 05:51:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:51:39,936 INFO L93 Difference]: Finished difference Result 242331 states and 442931 transitions. [2019-09-08 05:51:39,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:51:39,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 380 [2019-09-08 05:51:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:51:40,586 INFO L225 Difference]: With dead ends: 242331 [2019-09-08 05:51:40,586 INFO L226 Difference]: Without dead ends: 121550 [2019-09-08 05:51:40,864 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:51:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121550 states. [2019-09-08 05:51:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121550 to 121542. [2019-09-08 05:51:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121542 states. [2019-09-08 05:51:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121542 states to 121542 states and 222121 transitions. [2019-09-08 05:51:51,659 INFO L78 Accepts]: Start accepts. Automaton has 121542 states and 222121 transitions. Word has length 380 [2019-09-08 05:51:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:51:51,659 INFO L475 AbstractCegarLoop]: Abstraction has 121542 states and 222121 transitions. [2019-09-08 05:51:51,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:51:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 121542 states and 222121 transitions. [2019-09-08 05:51:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-09-08 05:51:51,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:51:51,737 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:51:51,737 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:51:51,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:51:51,738 INFO L82 PathProgramCache]: Analyzing trace with hash -457748528, now seen corresponding path program 1 times [2019-09-08 05:51:51,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:51:51,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:51:51,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:51,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:51:51,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:51:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 05:51:52,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:51:52,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:51:52,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:51:52,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:51:52,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:51:52,004 INFO L87 Difference]: Start difference. First operand 121542 states and 222121 transitions. Second operand 3 states. [2019-09-08 05:51:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:51:59,478 INFO L93 Difference]: Finished difference Result 244228 states and 446411 transitions. [2019-09-08 05:51:59,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:51:59,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-09-08 05:51:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:52:00,028 INFO L225 Difference]: With dead ends: 244228 [2019-09-08 05:52:00,028 INFO L226 Difference]: Without dead ends: 122806 [2019-09-08 05:52:00,299 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:52:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122806 states. [2019-09-08 05:52:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122806 to 122798. [2019-09-08 05:52:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122798 states. [2019-09-08 05:52:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122798 states to 122798 states and 224396 transitions. [2019-09-08 05:52:07,210 INFO L78 Accepts]: Start accepts. Automaton has 122798 states and 224396 transitions. Word has length 370 [2019-09-08 05:52:07,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:52:07,211 INFO L475 AbstractCegarLoop]: Abstraction has 122798 states and 224396 transitions. [2019-09-08 05:52:07,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:52:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 122798 states and 224396 transitions. [2019-09-08 05:52:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-09-08 05:52:07,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:52:07,277 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:52:07,277 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:52:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:52:07,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2041140860, now seen corresponding path program 1 times [2019-09-08 05:52:07,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:52:07,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:52:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:07,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:52:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:52:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-08 05:52:11,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:52:11,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:52:11,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:52:11,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:52:11,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:52:11,631 INFO L87 Difference]: Start difference. First operand 122798 states and 224396 transitions. Second operand 3 states. [2019-09-08 05:52:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:52:16,032 INFO L93 Difference]: Finished difference Result 248027 states and 453316 transitions. [2019-09-08 05:52:16,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:52:16,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 431 [2019-09-08 05:52:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:52:16,686 INFO L225 Difference]: With dead ends: 248027 [2019-09-08 05:52:16,686 INFO L226 Difference]: Without dead ends: 125336 [2019-09-08 05:52:16,956 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:52:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125336 states. [2019-09-08 05:52:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125336 to 125328. [2019-09-08 05:52:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125328 states. [2019-09-08 05:52:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125328 states to 125328 states and 228973 transitions. [2019-09-08 05:52:27,850 INFO L78 Accepts]: Start accepts. Automaton has 125328 states and 228973 transitions. Word has length 431 [2019-09-08 05:52:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:52:27,851 INFO L475 AbstractCegarLoop]: Abstraction has 125328 states and 228973 transitions. [2019-09-08 05:52:27,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:52:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 125328 states and 228973 transitions. [2019-09-08 05:52:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-08 05:52:27,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:52:27,950 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:52:27,950 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:52:27,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:52:27,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1014876501, now seen corresponding path program 1 times [2019-09-08 05:52:27,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:52:27,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:52:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:27,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:52:27,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:52:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-08 05:52:28,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:52:28,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:52:28,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:52:28,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:52:28,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:52:28,245 INFO L87 Difference]: Start difference. First operand 125328 states and 228973 transitions. Second operand 8 states. [2019-09-08 05:52:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:52:49,814 INFO L93 Difference]: Finished difference Result 376708 states and 692867 transitions. [2019-09-08 05:52:49,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:52:49,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 437 [2019-09-08 05:52:49,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:52:50,929 INFO L225 Difference]: With dead ends: 376708 [2019-09-08 05:52:50,929 INFO L226 Difference]: Without dead ends: 251514 [2019-09-08 05:52:51,651 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:52:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251514 states. [2019-09-08 05:53:01,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251514 to 159191. [2019-09-08 05:53:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159191 states. [2019-09-08 05:53:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159191 states to 159191 states and 291720 transitions. [2019-09-08 05:53:03,149 INFO L78 Accepts]: Start accepts. Automaton has 159191 states and 291720 transitions. Word has length 437 [2019-09-08 05:53:03,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:03,150 INFO L475 AbstractCegarLoop]: Abstraction has 159191 states and 291720 transitions. [2019-09-08 05:53:03,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:53:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 159191 states and 291720 transitions. [2019-09-08 05:53:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-08 05:53:03,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:03,258 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:53:03,258 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:03,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:03,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1545321746, now seen corresponding path program 1 times [2019-09-08 05:53:03,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:03,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:03,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:03,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:03,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 05:53:03,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:03,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:53:03,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:53:03,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:53:03,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:53:03,469 INFO L87 Difference]: Start difference. First operand 159191 states and 291720 transitions. Second operand 3 states. [2019-09-08 05:53:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:13,951 INFO L93 Difference]: Finished difference Result 327717 states and 602076 transitions. [2019-09-08 05:53:13,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:53:13,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 397 [2019-09-08 05:53:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:14,704 INFO L225 Difference]: With dead ends: 327717 [2019-09-08 05:53:14,704 INFO L226 Difference]: Without dead ends: 168691 [2019-09-08 05:53:15,075 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:53:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168691 states. [2019-09-08 05:53:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168691 to 152268. [2019-09-08 05:53:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152268 states. [2019-09-08 05:53:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152268 states to 152268 states and 280803 transitions. [2019-09-08 05:53:28,687 INFO L78 Accepts]: Start accepts. Automaton has 152268 states and 280803 transitions. Word has length 397 [2019-09-08 05:53:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:28,687 INFO L475 AbstractCegarLoop]: Abstraction has 152268 states and 280803 transitions. [2019-09-08 05:53:28,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:53:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 152268 states and 280803 transitions. [2019-09-08 05:53:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-09-08 05:53:28,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:28,844 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:53:28,844 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:28,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1424609903, now seen corresponding path program 1 times [2019-09-08 05:53:28,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:28,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:28,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:28,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:28,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-09-08 05:53:29,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:29,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:53:29,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:53:29,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:53:29,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:53:29,949 INFO L87 Difference]: Start difference. First operand 152268 states and 280803 transitions. Second operand 3 states. [2019-09-08 05:53:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:45,075 INFO L93 Difference]: Finished difference Result 322539 states and 598380 transitions. [2019-09-08 05:53:45,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:53:45,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 384 [2019-09-08 05:53:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:45,828 INFO L225 Difference]: With dead ends: 322539 [2019-09-08 05:53:45,829 INFO L226 Difference]: Without dead ends: 170456 [2019-09-08 05:53:46,197 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:53:46,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170456 states. [2019-09-08 05:53:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170456 to 160350. [2019-09-08 05:53:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160350 states. [2019-09-08 05:53:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160350 states to 160350 states and 299145 transitions. [2019-09-08 05:53:56,147 INFO L78 Accepts]: Start accepts. Automaton has 160350 states and 299145 transitions. Word has length 384 [2019-09-08 05:53:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:56,148 INFO L475 AbstractCegarLoop]: Abstraction has 160350 states and 299145 transitions. [2019-09-08 05:53:56,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:53:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 160350 states and 299145 transitions. [2019-09-08 05:53:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-08 05:53:56,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:56,444 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:53:56,444 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:56,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:56,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1527863509, now seen corresponding path program 1 times [2019-09-08 05:53:56,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:56,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:56,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:56,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:56,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:53:56,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:56,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:53:56,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:53:56,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:53:56,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:53:56,639 INFO L87 Difference]: Start difference. First operand 160350 states and 299145 transitions. Second operand 6 states. [2019-09-08 05:54:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:54:09,410 INFO L93 Difference]: Finished difference Result 320468 states and 597984 transitions. [2019-09-08 05:54:09,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:54:09,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 356 [2019-09-08 05:54:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:54:10,233 INFO L225 Difference]: With dead ends: 320468 [2019-09-08 05:54:10,234 INFO L226 Difference]: Without dead ends: 160358 [2019-09-08 05:54:11,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:54:11,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160358 states. [2019-09-08 05:54:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160358 to 160350. [2019-09-08 05:54:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160350 states. [2019-09-08 05:54:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160350 states to 160350 states and 298633 transitions. [2019-09-08 05:54:20,478 INFO L78 Accepts]: Start accepts. Automaton has 160350 states and 298633 transitions. Word has length 356 [2019-09-08 05:54:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:54:20,478 INFO L475 AbstractCegarLoop]: Abstraction has 160350 states and 298633 transitions. [2019-09-08 05:54:20,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:54:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 160350 states and 298633 transitions. [2019-09-08 05:54:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-09-08 05:54:20,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:54:20,770 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:54:20,771 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:54:20,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:54:20,771 INFO L82 PathProgramCache]: Analyzing trace with hash -858193233, now seen corresponding path program 1 times [2019-09-08 05:54:20,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:54:20,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:54:20,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:20,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:54:20,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:54:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-08 05:54:21,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:54:21,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:54:21,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:54:21,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:54:21,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:54:21,848 INFO L87 Difference]: Start difference. First operand 160350 states and 298633 transitions. Second operand 3 states. [2019-09-08 05:54:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:54:34,503 INFO L93 Difference]: Finished difference Result 355335 states and 667438 transitions. [2019-09-08 05:54:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:54:34,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 394 [2019-09-08 05:54:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:54:36,172 INFO L225 Difference]: With dead ends: 355335 [2019-09-08 05:54:36,172 INFO L226 Difference]: Without dead ends: 195176 [2019-09-08 05:54:36,522 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:54:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195176 states. [2019-09-08 05:54:52,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195176 to 195168. [2019-09-08 05:54:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195168 states. [2019-09-08 05:54:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195168 states to 195168 states and 368010 transitions. [2019-09-08 05:54:53,919 INFO L78 Accepts]: Start accepts. Automaton has 195168 states and 368010 transitions. Word has length 394 [2019-09-08 05:54:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:54:53,920 INFO L475 AbstractCegarLoop]: Abstraction has 195168 states and 368010 transitions. [2019-09-08 05:54:53,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:54:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 195168 states and 368010 transitions. [2019-09-08 05:54:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-09-08 05:54:54,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:54:54,449 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:54:54,449 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:54:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:54:54,450 INFO L82 PathProgramCache]: Analyzing trace with hash -283001236, now seen corresponding path program 1 times [2019-09-08 05:54:54,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:54:54,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:54:54,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:54,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:54:54,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:54:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 05:54:54,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:54:54,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:54:54,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:54:54,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:54:54,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:54:54,653 INFO L87 Difference]: Start difference. First operand 195168 states and 368010 transitions. Second operand 7 states. [2019-09-08 05:55:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:55:11,302 INFO L93 Difference]: Finished difference Result 390244 states and 739041 transitions. [2019-09-08 05:55:11,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:55:11,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 386 [2019-09-08 05:55:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:55:12,262 INFO L225 Difference]: With dead ends: 390244 [2019-09-08 05:55:12,262 INFO L226 Difference]: Without dead ends: 195312 [2019-09-08 05:55:13,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:55:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195312 states. [2019-09-08 05:55:23,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195312 to 195312. [2019-09-08 05:55:23,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195312 states. [2019-09-08 05:55:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195312 states to 195312 states and 368186 transitions. [2019-09-08 05:55:24,866 INFO L78 Accepts]: Start accepts. Automaton has 195312 states and 368186 transitions. Word has length 386 [2019-09-08 05:55:24,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:55:24,866 INFO L475 AbstractCegarLoop]: Abstraction has 195312 states and 368186 transitions. [2019-09-08 05:55:24,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:55:24,866 INFO L276 IsEmpty]: Start isEmpty. Operand 195312 states and 368186 transitions. [2019-09-08 05:55:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2019-09-08 05:55:26,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:55:26,679 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:55:26,680 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:55:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:55:26,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1514390369, now seen corresponding path program 1 times [2019-09-08 05:55:26,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:55:26,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:55:26,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:55:26,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:55:26,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:55:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:55:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-08 05:55:26,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:55:26,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:55:26,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:55:26,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:55:26,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:55:26,954 INFO L87 Difference]: Start difference. First operand 195312 states and 368186 transitions. Second operand 8 states. [2019-09-08 05:55:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:55:54,902 INFO L93 Difference]: Finished difference Result 587620 states and 1172168 transitions. [2019-09-08 05:55:54,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:55:54,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 457 [2019-09-08 05:55:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:55:58,006 INFO L225 Difference]: With dead ends: 587620 [2019-09-08 05:55:58,007 INFO L226 Difference]: Without dead ends: 392498 [2019-09-08 05:55:58,563 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:55:58,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392498 states. [2019-09-08 05:56:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392498 to 289247. [2019-09-08 05:56:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289247 states. [2019-09-08 05:56:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289247 states to 289247 states and 582270 transitions. [2019-09-08 05:56:32,218 INFO L78 Accepts]: Start accepts. Automaton has 289247 states and 582270 transitions. Word has length 457 [2019-09-08 05:56:32,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:32,219 INFO L475 AbstractCegarLoop]: Abstraction has 289247 states and 582270 transitions. [2019-09-08 05:56:32,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:56:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 289247 states and 582270 transitions. [2019-09-08 05:56:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-09-08 05:56:33,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:33,413 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:56:33,413 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:33,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:33,414 INFO L82 PathProgramCache]: Analyzing trace with hash -550803290, now seen corresponding path program 1 times [2019-09-08 05:56:33,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:33,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:33,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:33,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:33,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 05:56:33,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:56:33,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:56:33,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:56:33,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:56:33,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:56:33,709 INFO L87 Difference]: Start difference. First operand 289247 states and 582270 transitions. Second operand 8 states. [2019-09-08 05:57:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:22,498 INFO L93 Difference]: Finished difference Result 871289 states and 1882508 transitions. [2019-09-08 05:57:22,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:57:22,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 424 [2019-09-08 05:57:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:26,055 INFO L225 Difference]: With dead ends: 871289 [2019-09-08 05:57:26,055 INFO L226 Difference]: Without dead ends: 582284 [2019-09-08 05:57:28,154 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:57:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582284 states.