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_spec1_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:02:44,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:02:44,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:02:44,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:02:44,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:02:44,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:02:44,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:02:44,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:02:44,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:02:44,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:02:44,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:02:44,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:02:44,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:02:44,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:02:44,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:02:44,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:02:44,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:02:44,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:02:44,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:02:44,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:02:44,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:02:44,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:02:44,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:02:44,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:02:44,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:02:44,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:02:44,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:02:44,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:02:44,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:02:44,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:02:44,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:02:44,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:02:44,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:02:44,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:02:44,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:02:44,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:02:44,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:02:44,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:02:44,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:02:44,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:02:44,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:02:44,455 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-10-02 13:02:44,476 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:02:44,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:02:44,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:02:44,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:02:44,479 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:02:44,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:02:44,479 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:02:44,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:02:44,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:02:44,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:02:44,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:02:44,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:02:44,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:02:44,482 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:02:44,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:02:44,483 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:02:44,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:02:44,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:02:44,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:02:44,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:02:44,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:02:44,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:02:44,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:02:44,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:02:44,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:02:44,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:02:44,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:02:44,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:02:44,485 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:02:44,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:02:44,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:02:44,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:02:44,549 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:02:44,550 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:02:44,550 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product35.cil.c [2019-10-02 13:02:44,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8721104c/42a558bbf0444aad91190e1e5dcb9a76/FLAGceaa1b840 [2019-10-02 13:02:45,357 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:02:45,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product35.cil.c [2019-10-02 13:02:45,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8721104c/42a558bbf0444aad91190e1e5dcb9a76/FLAGceaa1b840 [2019-10-02 13:02:45,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8721104c/42a558bbf0444aad91190e1e5dcb9a76 [2019-10-02 13:02:45,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:02:45,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:02:45,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:02:45,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:02:45,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:02:45,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:02:45" (1/1) ... [2019-10-02 13:02:45,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35299c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:02:45, skipping insertion in model container [2019-10-02 13:02:45,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:02:45" (1/1) ... [2019-10-02 13:02:45,500 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:02:45,584 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:02:46,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:02:46,349 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:02:46,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:02:46,684 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:02:46,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:02:46 WrapperNode [2019-10-02 13:02:46,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:02:46,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:02:46,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:02:46,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:02:46,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:02:46" (1/1) ... [2019-10-02 13:02:46,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:02:46" (1/1) ... [2019-10-02 13:02:46,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:02:46" (1/1) ... [2019-10-02 13:02:46,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:02:46" (1/1) ... [2019-10-02 13:02:46,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:02:46" (1/1) ... [2019-10-02 13:02:46,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:02:46" (1/1) ... [2019-10-02 13:02:46,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:02:46" (1/1) ... [2019-10-02 13:02:46,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:02:46,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:02:46,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:02:46,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:02:46,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:02:46" (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-10-02 13:02:46,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:02:47,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:02:47,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:02:47,001 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:02:47,002 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:02:47,003 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:02:47,003 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:02:47,003 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:02:47,003 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:02:47,004 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:02:47,004 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:02:47,004 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:02:47,005 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:02:47,005 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:02:47,007 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:02:47,007 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:02:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:02:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:02:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:02:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:02:47,011 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:02:47,011 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:02:47,011 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:02:47,011 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:02:47,012 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:02:47,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:02:47,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:02:47,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:02:47,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:02:47,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:02:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:02:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 13:02:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:02:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:02:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:02:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 13:02:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:02:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:02:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:02:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:02:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 13:02:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:02:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:02:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:02:47,015 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:02:47,015 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:02:47,015 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:02:47,015 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:02:47,015 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:02:47,015 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:02:47,015 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:02:47,016 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:02:47,016 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:02:47,016 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:02:47,016 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:02:47,016 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:02:47,017 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:02:47,017 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:02:47,019 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:02:47,019 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:02:47,020 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:02:47,020 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:02:47,020 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:02:47,020 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:02:47,020 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:02:47,021 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:02:47,021 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:02:47,022 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:02:47,022 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:02:47,022 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:02:47,023 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:02:47,023 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:02:47,023 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:02:47,023 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:02:47,025 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:02:47,025 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:02:47,025 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:02:47,025 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:02:47,026 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:02:47,026 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:02:47,026 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:02:47,027 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:02:47,027 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:02:47,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:02:47,028 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:02:47,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:02:47,028 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:02:47,029 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:02:47,029 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 13:02:47,029 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 13:02:47,030 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:02:47,030 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:02:47,031 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:02:47,031 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:02:47,031 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:02:47,031 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:02:47,032 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:02:47,032 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:02:47,032 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:02:47,033 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:02:47,033 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:02:47,033 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:02:47,033 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:02:47,034 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:02:47,034 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:02:47,034 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:02:47,034 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:02:47,035 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:02:47,035 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:02:47,035 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:02:47,036 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:02:47,036 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:02:47,036 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:02:47,036 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:02:47,037 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:02:47,037 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:02:47,037 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:02:47,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:02:47,038 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:02:47,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:02:47,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:02:47,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:02:47,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:02:47,040 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:02:47,041 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:02:47,042 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:02:47,042 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:02:47,042 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:02:47,042 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:02:47,042 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:02:47,042 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:02:47,043 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:02:47,043 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:02:47,043 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:02:47,044 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:02:47,044 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:02:47,044 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:02:47,044 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:02:47,045 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:02:47,045 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:02:47,048 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:02:47,049 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:02:47,049 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:02:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:02:47,054 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:02:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:02:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:02:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:02:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:02:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:02:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:02:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:02:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:02:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:02:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:02:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:02:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:02:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:02:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:02:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:02:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:02:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:02:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:02:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:02:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:02:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:02:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:02:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:02:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:02:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:02:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:02:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:02:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:02:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:02:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:02:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:02:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:02:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:02:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:02:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:02:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:02:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:02:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:02:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:02:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:02:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:02:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:02:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:02:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 13:02:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:02:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:02:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:02:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:02:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:02:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:02:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:02:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:02:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:02:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:02:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:02:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:02:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:02:47,071 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:02:47,071 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:02:47,071 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:02:47,071 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:02:47,071 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:02:47,072 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:02:47,072 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:02:47,072 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:02:47,072 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:02:47,072 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:02:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:02:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:02:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:02:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:02:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:02:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:02:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:02:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:02:47,074 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:02:47,075 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:02:47,075 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:02:47,075 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:02:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:02:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 13:02:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:02:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:02:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 13:02:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:02:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:02:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:02:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:02:47,078 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:02:47,078 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:02:47,078 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:02:47,078 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:02:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:02:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:02:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:02:47,079 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:02:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:02:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:02:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:02:47,080 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 13:02:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 13:02:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:02:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:02:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:02:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:02:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:02:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:02:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:02:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:02:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:02:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:02:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:02:49,733 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:02:49,733 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:02:49,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:02:49 BoogieIcfgContainer [2019-10-02 13:02:49,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:02:49,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:02:49,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:02:49,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:02:49,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:02:45" (1/3) ... [2019-10-02 13:02:49,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae612a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:02:49, skipping insertion in model container [2019-10-02 13:02:49,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:02:46" (2/3) ... [2019-10-02 13:02:49,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae612a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:02:49, skipping insertion in model container [2019-10-02 13:02:49,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:02:49" (3/3) ... [2019-10-02 13:02:49,744 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product35.cil.c [2019-10-02 13:02:49,753 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:02:49,763 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:02:49,780 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:02:49,817 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:02:49,818 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:02:49,818 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:02:49,818 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:02:49,818 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:02:49,818 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:02:49,818 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:02:49,819 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:02:49,819 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:02:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-10-02 13:02:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 13:02:49,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:49,876 INFO L411 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-10-02 13:02:49,878 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:49,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:49,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2000254707, now seen corresponding path program 1 times [2019-10-02 13:02:49,886 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:49,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:49,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:49,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:49,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:02:50,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:02:50,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:02:50,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:02:50,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:02:50,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:02:50,620 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 2 states. [2019-10-02 13:02:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:02:50,739 INFO L93 Difference]: Finished difference Result 1041 states and 1401 transitions. [2019-10-02 13:02:50,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:02:50,741 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 167 [2019-10-02 13:02:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:02:50,766 INFO L225 Difference]: With dead ends: 1041 [2019-10-02 13:02:50,766 INFO L226 Difference]: Without dead ends: 654 [2019-10-02 13:02:50,776 INFO L640 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-10-02 13:02:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-10-02 13:02:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2019-10-02 13:02:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-10-02 13:02:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 886 transitions. [2019-10-02 13:02:50,925 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 886 transitions. Word has length 167 [2019-10-02 13:02:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:02:50,928 INFO L475 AbstractCegarLoop]: Abstraction has 654 states and 886 transitions. [2019-10-02 13:02:50,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:02:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 886 transitions. [2019-10-02 13:02:50,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 13:02:50,936 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:50,937 INFO L411 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-10-02 13:02:50,937 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:50,938 INFO L82 PathProgramCache]: Analyzing trace with hash -113986778, now seen corresponding path program 1 times [2019-10-02 13:02:50,938 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:50,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:50,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:50,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:50,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:02:51,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:02:51,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:02:51,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:02:51,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:02:51,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:02:51,266 INFO L87 Difference]: Start difference. First operand 654 states and 886 transitions. Second operand 3 states. [2019-10-02 13:02:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:02:51,352 INFO L93 Difference]: Finished difference Result 1024 states and 1366 transitions. [2019-10-02 13:02:51,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:02:51,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 13:02:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:02:51,364 INFO L225 Difference]: With dead ends: 1024 [2019-10-02 13:02:51,365 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 13:02:51,372 INFO L640 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-10-02 13:02:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 13:02:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 656. [2019-10-02 13:02:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-10-02 13:02:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 888 transitions. [2019-10-02 13:02:51,424 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 888 transitions. Word has length 168 [2019-10-02 13:02:51,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:02:51,424 INFO L475 AbstractCegarLoop]: Abstraction has 656 states and 888 transitions. [2019-10-02 13:02:51,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:02:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 888 transitions. [2019-10-02 13:02:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 13:02:51,520 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:51,520 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:02:51,521 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:51,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:51,521 INFO L82 PathProgramCache]: Analyzing trace with hash 956315413, now seen corresponding path program 1 times [2019-10-02 13:02:51,521 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:51,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:51,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:51,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:51,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:02:51,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:02:51,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:02:51,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:02:51,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:02:51,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:02:51,700 INFO L87 Difference]: Start difference. First operand 656 states and 888 transitions. Second operand 3 states. [2019-10-02 13:02:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:02:51,750 INFO L93 Difference]: Finished difference Result 1292 states and 1780 transitions. [2019-10-02 13:02:51,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:02:51,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-02 13:02:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:02:51,756 INFO L225 Difference]: With dead ends: 1292 [2019-10-02 13:02:51,757 INFO L226 Difference]: Without dead ends: 701 [2019-10-02 13:02:51,759 INFO L640 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-10-02 13:02:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-10-02 13:02:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 700. [2019-10-02 13:02:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-10-02 13:02:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 963 transitions. [2019-10-02 13:02:51,791 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 963 transitions. Word has length 180 [2019-10-02 13:02:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:02:51,791 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 963 transitions. [2019-10-02 13:02:51,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:02:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 963 transitions. [2019-10-02 13:02:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 13:02:51,796 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:51,796 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:02:51,796 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:51,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:51,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2106221254, now seen corresponding path program 1 times [2019-10-02 13:02:51,797 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:51,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:51,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:51,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:51,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:02:51,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:02:51,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:02:51,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:02:51,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:02:51,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:02:51,952 INFO L87 Difference]: Start difference. First operand 700 states and 963 transitions. Second operand 3 states. [2019-10-02 13:02:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:02:51,995 INFO L93 Difference]: Finished difference Result 1421 states and 2000 transitions. [2019-10-02 13:02:51,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:02:51,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-02 13:02:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:02:52,001 INFO L225 Difference]: With dead ends: 1421 [2019-10-02 13:02:52,001 INFO L226 Difference]: Without dead ends: 786 [2019-10-02 13:02:52,004 INFO L640 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-10-02 13:02:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-10-02 13:02:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 785. [2019-10-02 13:02:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-10-02 13:02:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1107 transitions. [2019-10-02 13:02:52,047 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1107 transitions. Word has length 181 [2019-10-02 13:02:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:02:52,048 INFO L475 AbstractCegarLoop]: Abstraction has 785 states and 1107 transitions. [2019-10-02 13:02:52,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:02:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1107 transitions. [2019-10-02 13:02:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 13:02:52,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:52,054 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:02:52,054 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:52,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:52,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1485976180, now seen corresponding path program 1 times [2019-10-02 13:02:52,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:52,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:52,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:52,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 13:02:54,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:02:54,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2019-10-02 13:02:54,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 13:02:54,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 13:02:54,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1717, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 13:02:54,100 INFO L87 Difference]: Start difference. First operand 785 states and 1107 transitions. Second operand 43 states. [2019-10-02 13:03:00,768 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-10-02 13:03:02,418 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-10-02 13:03:06,379 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-10-02 13:03:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:03:44,771 INFO L93 Difference]: Finished difference Result 7551 states and 10789 transitions. [2019-10-02 13:03:44,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2019-10-02 13:03:44,774 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 184 [2019-10-02 13:03:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:03:44,819 INFO L225 Difference]: With dead ends: 7551 [2019-10-02 13:03:44,819 INFO L226 Difference]: Without dead ends: 6783 [2019-10-02 13:03:44,840 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17662 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=2814, Invalid=49856, Unknown=0, NotChecked=0, Total=52670 [2019-10-02 13:03:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6783 states. [2019-10-02 13:03:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6783 to 6660. [2019-10-02 13:03:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-10-02 13:03:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9465 transitions. [2019-10-02 13:03:45,286 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9465 transitions. Word has length 184 [2019-10-02 13:03:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:03:45,287 INFO L475 AbstractCegarLoop]: Abstraction has 6660 states and 9465 transitions. [2019-10-02 13:03:45,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 13:03:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9465 transitions. [2019-10-02 13:03:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 13:03:45,318 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:03:45,319 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:03:45,320 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:03:45,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:03:45,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2129877941, now seen corresponding path program 1 times [2019-10-02 13:03:45,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:03:45,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:03:45,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:45,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:03:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:03:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:03:45,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:03:45,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:03:45,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:03:45,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:03:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:03:45,582 INFO L87 Difference]: Start difference. First operand 6660 states and 9465 transitions. Second operand 3 states. [2019-10-02 13:03:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:03:45,798 INFO L93 Difference]: Finished difference Result 14186 states and 20554 transitions. [2019-10-02 13:03:45,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:03:45,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-10-02 13:03:45,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:03:45,854 INFO L225 Difference]: With dead ends: 14186 [2019-10-02 13:03:45,854 INFO L226 Difference]: Without dead ends: 7650 [2019-10-02 13:03:45,880 INFO L640 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-10-02 13:03:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7650 states. [2019-10-02 13:03:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7650 to 7644. [2019-10-02 13:03:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7644 states. [2019-10-02 13:03:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7644 states to 7644 states and 11207 transitions. [2019-10-02 13:03:46,447 INFO L78 Accepts]: Start accepts. Automaton has 7644 states and 11207 transitions. Word has length 184 [2019-10-02 13:03:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:03:46,451 INFO L475 AbstractCegarLoop]: Abstraction has 7644 states and 11207 transitions. [2019-10-02 13:03:46,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:03:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 7644 states and 11207 transitions. [2019-10-02 13:03:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 13:03:46,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:03:46,490 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 13:03:46,490 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:03:46,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:03:46,491 INFO L82 PathProgramCache]: Analyzing trace with hash 594022345, now seen corresponding path program 1 times [2019-10-02 13:03:46,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:03:46,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:03:46,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:46,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:03:46,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:03:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:03:46,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:03:46,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:03:46,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:03:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:03:46,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:03:46,890 INFO L87 Difference]: Start difference. First operand 7644 states and 11207 transitions. Second operand 13 states. [2019-10-02 13:03:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:03:47,818 INFO L93 Difference]: Finished difference Result 12350 states and 17603 transitions. [2019-10-02 13:03:47,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:03:47,819 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 187 [2019-10-02 13:03:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:03:47,883 INFO L225 Difference]: With dead ends: 12350 [2019-10-02 13:03:47,883 INFO L226 Difference]: Without dead ends: 7998 [2019-10-02 13:03:47,901 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:03:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7998 states. [2019-10-02 13:03:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7998 to 7998. [2019-10-02 13:03:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7998 states. [2019-10-02 13:03:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7998 states to 7998 states and 11764 transitions. [2019-10-02 13:03:48,290 INFO L78 Accepts]: Start accepts. Automaton has 7998 states and 11764 transitions. Word has length 187 [2019-10-02 13:03:48,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:03:48,291 INFO L475 AbstractCegarLoop]: Abstraction has 7998 states and 11764 transitions. [2019-10-02 13:03:48,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:03:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 7998 states and 11764 transitions. [2019-10-02 13:03:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 13:03:48,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:03:48,317 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 13:03:48,318 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:03:48,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:03:48,318 INFO L82 PathProgramCache]: Analyzing trace with hash -854963278, now seen corresponding path program 1 times [2019-10-02 13:03:48,318 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:03:48,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:03:48,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:48,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:03:48,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:03:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:03:48,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:03:48,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:03:48,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:03:48,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:03:48,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:03:48,506 INFO L87 Difference]: Start difference. First operand 7998 states and 11764 transitions. Second operand 5 states. [2019-10-02 13:03:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:03:50,448 INFO L93 Difference]: Finished difference Result 18791 states and 27238 transitions. [2019-10-02 13:03:50,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 13:03:50,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-10-02 13:03:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:03:50,537 INFO L225 Difference]: With dead ends: 18791 [2019-10-02 13:03:50,537 INFO L226 Difference]: Without dead ends: 16516 [2019-10-02 13:03:50,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:03:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16516 states. [2019-10-02 13:03:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16516 to 16478. [2019-10-02 13:03:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16478 states. [2019-10-02 13:03:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16478 states to 16478 states and 24019 transitions. [2019-10-02 13:03:51,303 INFO L78 Accepts]: Start accepts. Automaton has 16478 states and 24019 transitions. Word has length 187 [2019-10-02 13:03:51,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:03:51,304 INFO L475 AbstractCegarLoop]: Abstraction has 16478 states and 24019 transitions. [2019-10-02 13:03:51,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:03:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 16478 states and 24019 transitions. [2019-10-02 13:03:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 13:03:51,346 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:03:51,347 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 13:03:51,347 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:03:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:03:51,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2037182000, now seen corresponding path program 1 times [2019-10-02 13:03:51,348 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:03:51,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:03:51,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:51,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:03:51,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:03:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:03:51,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:03:51,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 13:03:51,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 13:03:51,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 13:03:51,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 13:03:51,707 INFO L87 Difference]: Start difference. First operand 16478 states and 24019 transitions. Second operand 14 states. [2019-10-02 13:03:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:03:52,470 INFO L93 Difference]: Finished difference Result 27906 states and 39670 transitions. [2019-10-02 13:03:52,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:03:52,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 187 [2019-10-02 13:03:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:03:52,553 INFO L225 Difference]: With dead ends: 27906 [2019-10-02 13:03:52,553 INFO L226 Difference]: Without dead ends: 16511 [2019-10-02 13:03:52,601 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:03:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16511 states. [2019-10-02 13:03:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16511 to 16511. [2019-10-02 13:03:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16511 states. [2019-10-02 13:03:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16511 states to 16511 states and 24094 transitions. [2019-10-02 13:03:53,333 INFO L78 Accepts]: Start accepts. Automaton has 16511 states and 24094 transitions. Word has length 187 [2019-10-02 13:03:53,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:03:53,336 INFO L475 AbstractCegarLoop]: Abstraction has 16511 states and 24094 transitions. [2019-10-02 13:03:53,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 13:03:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 16511 states and 24094 transitions. [2019-10-02 13:03:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 13:03:53,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:03:53,373 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 13:03:53,374 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:03:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:03:53,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1429900177, now seen corresponding path program 1 times [2019-10-02 13:03:53,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:03:53,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:03:53,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:53,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:03:53,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:03:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 13:03:53,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:03:53,948 INFO L224 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-10-02 13:03:54,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:03:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:03:55,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 3020 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:03:55,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:03:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:03:55,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:03:55,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [22] total 26 [2019-10-02 13:03:55,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:03:55,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:03:55,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:03:55,786 INFO L87 Difference]: Start difference. First operand 16511 states and 24094 transitions. Second operand 26 states. [2019-10-02 13:04:01,579 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-10-02 13:04:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:04:07,071 INFO L93 Difference]: Finished difference Result 28235 states and 41129 transitions. [2019-10-02 13:04:07,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 13:04:07,071 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 187 [2019-10-02 13:04:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:04:07,150 INFO L225 Difference]: With dead ends: 28235 [2019-10-02 13:04:07,151 INFO L226 Difference]: Without dead ends: 13432 [2019-10-02 13:04:07,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=366, Invalid=3666, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 13:04:07,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13432 states. [2019-10-02 13:04:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13432 to 13400. [2019-10-02 13:04:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13400 states. [2019-10-02 13:04:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13400 states to 13400 states and 19805 transitions. [2019-10-02 13:04:08,344 INFO L78 Accepts]: Start accepts. Automaton has 13400 states and 19805 transitions. Word has length 187 [2019-10-02 13:04:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:04:08,345 INFO L475 AbstractCegarLoop]: Abstraction has 13400 states and 19805 transitions. [2019-10-02 13:04:08,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:04:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 13400 states and 19805 transitions. [2019-10-02 13:04:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 13:04:08,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:04:08,388 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:04:08,388 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:04:08,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:04:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash -316574266, now seen corresponding path program 1 times [2019-10-02 13:04:08,389 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:04:08,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:04:08,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:08,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:08,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:04:08,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:04:08,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:04:08,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:04:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:04:08,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:04:08,724 INFO L87 Difference]: Start difference. First operand 13400 states and 19805 transitions. Second operand 11 states. [2019-10-02 13:04:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:04:09,442 INFO L93 Difference]: Finished difference Result 19051 states and 27447 transitions. [2019-10-02 13:04:09,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:04:09,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2019-10-02 13:04:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:04:09,500 INFO L225 Difference]: With dead ends: 19051 [2019-10-02 13:04:09,500 INFO L226 Difference]: Without dead ends: 10824 [2019-10-02 13:04:09,520 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:04:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10824 states. [2019-10-02 13:04:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10824 to 10802. [2019-10-02 13:04:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10802 states. [2019-10-02 13:04:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10802 states to 10802 states and 16286 transitions. [2019-10-02 13:04:10,205 INFO L78 Accepts]: Start accepts. Automaton has 10802 states and 16286 transitions. Word has length 188 [2019-10-02 13:04:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:04:10,205 INFO L475 AbstractCegarLoop]: Abstraction has 10802 states and 16286 transitions. [2019-10-02 13:04:10,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:04:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand 10802 states and 16286 transitions. [2019-10-02 13:04:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 13:04:10,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:04:10,226 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:04:10,227 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:04:10,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:04:10,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1356605022, now seen corresponding path program 1 times [2019-10-02 13:04:10,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:04:10,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:04:10,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:10,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:10,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:10,394 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:04:10,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:04:10,394 INFO L224 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-10-02 13:04:10,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:11,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 3023 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:04:11,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:04:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:04:11,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:04:11,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 13:04:11,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:04:11,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:04:11,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:04:11,233 INFO L87 Difference]: Start difference. First operand 10802 states and 16286 transitions. Second operand 12 states. [2019-10-02 13:04:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:04:13,865 INFO L93 Difference]: Finished difference Result 19905 states and 29703 transitions. [2019-10-02 13:04:13,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:04:13,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 189 [2019-10-02 13:04:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:04:13,906 INFO L225 Difference]: With dead ends: 19905 [2019-10-02 13:04:13,906 INFO L226 Difference]: Without dead ends: 9169 [2019-10-02 13:04:13,932 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:04:13,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9169 states. [2019-10-02 13:04:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9169 to 9143. [2019-10-02 13:04:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9143 states. [2019-10-02 13:04:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 13466 transitions. [2019-10-02 13:04:14,334 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 13466 transitions. Word has length 189 [2019-10-02 13:04:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:04:14,337 INFO L475 AbstractCegarLoop]: Abstraction has 9143 states and 13466 transitions. [2019-10-02 13:04:14,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:04:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 13466 transitions. [2019-10-02 13:04:14,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 13:04:14,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:04:14,552 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:04:14,552 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:04:14,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:04:14,555 INFO L82 PathProgramCache]: Analyzing trace with hash -743777367, now seen corresponding path program 1 times [2019-10-02 13:04:14,555 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:04:14,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:04:14,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:14,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:14,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 13:04:15,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:04:15,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 13:04:15,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:04:15,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:04:15,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:04:15,161 INFO L87 Difference]: Start difference. First operand 9143 states and 13466 transitions. Second operand 26 states. [2019-10-02 13:04:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:04:28,518 INFO L93 Difference]: Finished difference Result 24219 states and 35155 transitions. [2019-10-02 13:04:28,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 13:04:28,520 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 197 [2019-10-02 13:04:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:04:28,611 INFO L225 Difference]: With dead ends: 24219 [2019-10-02 13:04:28,611 INFO L226 Difference]: Without dead ends: 20804 [2019-10-02 13:04:28,629 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 13:04:28,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20804 states. [2019-10-02 13:04:29,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20804 to 18331. [2019-10-02 13:04:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18331 states. [2019-10-02 13:04:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18331 states to 18331 states and 27106 transitions. [2019-10-02 13:04:29,704 INFO L78 Accepts]: Start accepts. Automaton has 18331 states and 27106 transitions. Word has length 197 [2019-10-02 13:04:29,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:04:29,705 INFO L475 AbstractCegarLoop]: Abstraction has 18331 states and 27106 transitions. [2019-10-02 13:04:29,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:04:29,705 INFO L276 IsEmpty]: Start isEmpty. Operand 18331 states and 27106 transitions. [2019-10-02 13:04:29,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 13:04:29,732 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:04:29,732 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:04:29,732 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:04:29,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:04:29,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1156996789, now seen corresponding path program 1 times [2019-10-02 13:04:29,733 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:04:29,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:04:29,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:29,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:29,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 13:04:29,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:04:29,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:04:29,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:04:29,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:04:29,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:04:29,953 INFO L87 Difference]: Start difference. First operand 18331 states and 27106 transitions. Second operand 9 states. [2019-10-02 13:04:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:04:30,463 INFO L93 Difference]: Finished difference Result 20693 states and 30319 transitions. [2019-10-02 13:04:30,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:04:30,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 198 [2019-10-02 13:04:30,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:04:30,497 INFO L225 Difference]: With dead ends: 20693 [2019-10-02 13:04:30,497 INFO L226 Difference]: Without dead ends: 9155 [2019-10-02 13:04:30,523 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:04:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9155 states. [2019-10-02 13:04:30,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9155 to 9153. [2019-10-02 13:04:30,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9153 states. [2019-10-02 13:04:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9153 states to 9153 states and 13477 transitions. [2019-10-02 13:04:30,968 INFO L78 Accepts]: Start accepts. Automaton has 9153 states and 13477 transitions. Word has length 198 [2019-10-02 13:04:30,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:04:30,968 INFO L475 AbstractCegarLoop]: Abstraction has 9153 states and 13477 transitions. [2019-10-02 13:04:30,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:04:30,968 INFO L276 IsEmpty]: Start isEmpty. Operand 9153 states and 13477 transitions. [2019-10-02 13:04:30,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 13:04:30,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:04:30,983 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:04:30,983 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:04:30,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:04:30,983 INFO L82 PathProgramCache]: Analyzing trace with hash 220021202, now seen corresponding path program 2 times [2019-10-02 13:04:30,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:04:30,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:04:30,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:30,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:30,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:04:31,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:04:31,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:04:31,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:04:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:04:31,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:04:31,483 INFO L87 Difference]: Start difference. First operand 9153 states and 13477 transitions. Second operand 24 states. [2019-10-02 13:04:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:04:43,934 INFO L93 Difference]: Finished difference Result 24208 states and 35141 transitions. [2019-10-02 13:04:43,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 13:04:43,935 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 198 [2019-10-02 13:04:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:04:43,985 INFO L225 Difference]: With dead ends: 24208 [2019-10-02 13:04:43,986 INFO L226 Difference]: Without dead ends: 20797 [2019-10-02 13:04:44,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=769, Invalid=5711, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 13:04:44,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20797 states. [2019-10-02 13:04:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20797 to 18326. [2019-10-02 13:04:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18326 states. [2019-10-02 13:04:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18326 states to 18326 states and 27098 transitions. [2019-10-02 13:04:44,739 INFO L78 Accepts]: Start accepts. Automaton has 18326 states and 27098 transitions. Word has length 198 [2019-10-02 13:04:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:04:44,739 INFO L475 AbstractCegarLoop]: Abstraction has 18326 states and 27098 transitions. [2019-10-02 13:04:44,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:04:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 18326 states and 27098 transitions. [2019-10-02 13:04:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 13:04:44,765 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:04:44,765 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:04:44,766 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:04:44,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:04:44,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1344012222, now seen corresponding path program 2 times [2019-10-02 13:04:44,766 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:04:44,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:04:44,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:44,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:04:44,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:04:44,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:04:44,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:04:44,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:04:44,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:04:44,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:04:44,925 INFO L87 Difference]: Start difference. First operand 18326 states and 27098 transitions. Second operand 7 states. [2019-10-02 13:04:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:04:45,631 INFO L93 Difference]: Finished difference Result 20686 states and 30309 transitions. [2019-10-02 13:04:45,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:04:45,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2019-10-02 13:04:45,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:04:45,650 INFO L225 Difference]: With dead ends: 20686 [2019-10-02 13:04:45,650 INFO L226 Difference]: Without dead ends: 9153 [2019-10-02 13:04:45,670 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:04:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9153 states. [2019-10-02 13:04:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9153 to 9153. [2019-10-02 13:04:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9153 states. [2019-10-02 13:04:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9153 states to 9153 states and 13476 transitions. [2019-10-02 13:04:46,085 INFO L78 Accepts]: Start accepts. Automaton has 9153 states and 13476 transitions. Word has length 199 [2019-10-02 13:04:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:04:46,086 INFO L475 AbstractCegarLoop]: Abstraction has 9153 states and 13476 transitions. [2019-10-02 13:04:46,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:04:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 9153 states and 13476 transitions. [2019-10-02 13:04:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 13:04:46,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:04:46,100 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:04:46,100 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:04:46,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:04:46,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1000784469, now seen corresponding path program 3 times [2019-10-02 13:04:46,100 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:04:46,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:04:46,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:46,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:04:46,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:04:46,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:04:46,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 13:04:46,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:04:46,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:04:46,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:04:46,643 INFO L87 Difference]: Start difference. First operand 9153 states and 13476 transitions. Second operand 26 states. [2019-10-02 13:04:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:04:59,443 INFO L93 Difference]: Finished difference Result 24217 states and 35150 transitions. [2019-10-02 13:04:59,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 13:04:59,444 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 199 [2019-10-02 13:04:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:04:59,499 INFO L225 Difference]: With dead ends: 24217 [2019-10-02 13:04:59,499 INFO L226 Difference]: Without dead ends: 20806 [2019-10-02 13:04:59,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 13:04:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20806 states. [2019-10-02 13:05:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20806 to 18331. [2019-10-02 13:05:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18331 states. [2019-10-02 13:05:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18331 states to 18331 states and 27103 transitions. [2019-10-02 13:05:00,135 INFO L78 Accepts]: Start accepts. Automaton has 18331 states and 27103 transitions. Word has length 199 [2019-10-02 13:05:00,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:00,135 INFO L475 AbstractCegarLoop]: Abstraction has 18331 states and 27103 transitions. [2019-10-02 13:05:00,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:05:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 18331 states and 27103 transitions. [2019-10-02 13:05:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:05:00,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:00,153 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:05:00,153 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:00,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:00,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1384812575, now seen corresponding path program 3 times [2019-10-02 13:05:00,153 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:00,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:00,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:00,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:05:00,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:05:00,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:05:00,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:05:00,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:05:00,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:05:00,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:05:00,521 INFO L87 Difference]: Start difference. First operand 18331 states and 27103 transitions. Second operand 9 states. [2019-10-02 13:05:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:05:01,065 INFO L93 Difference]: Finished difference Result 20695 states and 30318 transitions. [2019-10-02 13:05:01,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:05:01,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2019-10-02 13:05:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:05:01,090 INFO L225 Difference]: With dead ends: 20695 [2019-10-02 13:05:01,090 INFO L226 Difference]: Without dead ends: 9157 [2019-10-02 13:05:01,118 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:05:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9157 states. [2019-10-02 13:05:01,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9157 to 9153. [2019-10-02 13:05:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9153 states. [2019-10-02 13:05:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9153 states to 9153 states and 13475 transitions. [2019-10-02 13:05:01,469 INFO L78 Accepts]: Start accepts. Automaton has 9153 states and 13475 transitions. Word has length 200 [2019-10-02 13:05:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:01,469 INFO L475 AbstractCegarLoop]: Abstraction has 9153 states and 13475 transitions. [2019-10-02 13:05:01,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:05:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 9153 states and 13475 transitions. [2019-10-02 13:05:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:05:01,479 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:01,480 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:05:01,480 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:01,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:01,480 INFO L82 PathProgramCache]: Analyzing trace with hash 220321817, now seen corresponding path program 1 times [2019-10-02 13:05:01,480 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:01,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:01,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:01,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:05:01,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:05:01,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:05:01,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:05:01,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:05:01,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:05:01,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:05:01,966 INFO L87 Difference]: Start difference. First operand 9153 states and 13475 transitions. Second operand 24 states. [2019-10-02 13:05:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:05:15,253 INFO L93 Difference]: Finished difference Result 29913 states and 44034 transitions. [2019-10-02 13:05:15,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-02 13:05:15,254 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 200 [2019-10-02 13:05:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:05:15,307 INFO L225 Difference]: With dead ends: 29913 [2019-10-02 13:05:15,308 INFO L226 Difference]: Without dead ends: 20835 [2019-10-02 13:05:15,326 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=781, Invalid=5861, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 13:05:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20835 states. [2019-10-02 13:05:15,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20835 to 18328. [2019-10-02 13:05:15,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18328 states. [2019-10-02 13:05:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18328 states to 18328 states and 27093 transitions. [2019-10-02 13:05:15,920 INFO L78 Accepts]: Start accepts. Automaton has 18328 states and 27093 transitions. Word has length 200 [2019-10-02 13:05:15,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:15,921 INFO L475 AbstractCegarLoop]: Abstraction has 18328 states and 27093 transitions. [2019-10-02 13:05:15,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:05:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 18328 states and 27093 transitions. [2019-10-02 13:05:15,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 13:05:15,939 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:15,939 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:05:15,939 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:15,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:15,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1334693157, now seen corresponding path program 1 times [2019-10-02 13:05:15,939 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:15,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:15,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:05:16,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:05:16,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:05:16,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:05:16,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:05:16,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:05:16,103 INFO L87 Difference]: Start difference. First operand 18328 states and 27093 transitions. Second operand 7 states. [2019-10-02 13:05:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:05:16,856 INFO L93 Difference]: Finished difference Result 20712 states and 30328 transitions. [2019-10-02 13:05:16,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:05:16,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2019-10-02 13:05:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:05:16,876 INFO L225 Difference]: With dead ends: 20712 [2019-10-02 13:05:16,877 INFO L226 Difference]: Without dead ends: 9179 [2019-10-02 13:05:16,893 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:05:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9179 states. [2019-10-02 13:05:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9179 to 9155. [2019-10-02 13:05:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9155 states. [2019-10-02 13:05:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9155 states to 9155 states and 13477 transitions. [2019-10-02 13:05:17,161 INFO L78 Accepts]: Start accepts. Automaton has 9155 states and 13477 transitions. Word has length 201 [2019-10-02 13:05:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:17,161 INFO L475 AbstractCegarLoop]: Abstraction has 9155 states and 13477 transitions. [2019-10-02 13:05:17,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:05:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 9155 states and 13477 transitions. [2019-10-02 13:05:17,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 13:05:17,169 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:17,169 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:05:17,169 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:17,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:17,169 INFO L82 PathProgramCache]: Analyzing trace with hash -917269047, now seen corresponding path program 1 times [2019-10-02 13:05:17,169 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:17,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:17,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:17,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:17,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:05:17,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:05:17,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:05:17,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:05:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:05:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:05:17,522 INFO L87 Difference]: Start difference. First operand 9155 states and 13477 transitions. Second operand 18 states. [2019-10-02 13:05:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:05:24,150 INFO L93 Difference]: Finished difference Result 15078 states and 21656 transitions. [2019-10-02 13:05:24,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 13:05:24,150 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 201 [2019-10-02 13:05:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:05:24,179 INFO L225 Difference]: With dead ends: 15078 [2019-10-02 13:05:24,179 INFO L226 Difference]: Without dead ends: 11667 [2019-10-02 13:05:24,189 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 13:05:24,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11667 states. [2019-10-02 13:05:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11667 to 11613. [2019-10-02 13:05:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11613 states. [2019-10-02 13:05:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11613 states to 11613 states and 16921 transitions. [2019-10-02 13:05:24,561 INFO L78 Accepts]: Start accepts. Automaton has 11613 states and 16921 transitions. Word has length 201 [2019-10-02 13:05:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:24,562 INFO L475 AbstractCegarLoop]: Abstraction has 11613 states and 16921 transitions. [2019-10-02 13:05:24,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:05:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 11613 states and 16921 transitions. [2019-10-02 13:05:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 13:05:24,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:24,573 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:05:24,573 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:24,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:24,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2054695723, now seen corresponding path program 1 times [2019-10-02 13:05:24,574 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:24,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:24,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:24,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:24,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:05:24,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:05:24,949 INFO L224 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-10-02 13:05:25,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:25,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 3068 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:05:25,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:05:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:05:25,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:05:25,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 13:05:25,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:05:25,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:05:25,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:05:25,774 INFO L87 Difference]: Start difference. First operand 11613 states and 16921 transitions. Second operand 5 states. [2019-10-02 13:05:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:05:26,312 INFO L93 Difference]: Finished difference Result 17645 states and 25208 transitions. [2019-10-02 13:05:26,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 13:05:26,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2019-10-02 13:05:26,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:05:26,357 INFO L225 Difference]: With dead ends: 17645 [2019-10-02 13:05:26,357 INFO L226 Difference]: Without dead ends: 11698 [2019-10-02 13:05:26,375 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:05:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11698 states. [2019-10-02 13:05:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11698 to 11688. [2019-10-02 13:05:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11688 states. [2019-10-02 13:05:26,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11688 states to 11688 states and 17038 transitions. [2019-10-02 13:05:26,840 INFO L78 Accepts]: Start accepts. Automaton has 11688 states and 17038 transitions. Word has length 202 [2019-10-02 13:05:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:26,840 INFO L475 AbstractCegarLoop]: Abstraction has 11688 states and 17038 transitions. [2019-10-02 13:05:26,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:05:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 11688 states and 17038 transitions. [2019-10-02 13:05:26,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:05:26,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:26,849 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:05:26,849 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:26,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:26,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2128812037, now seen corresponding path program 1 times [2019-10-02 13:05:26,850 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:26,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:26,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:26,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:26,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:05:26,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:05:26,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:05:26,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:05:26,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:05:26,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:05:26,973 INFO L87 Difference]: Start difference. First operand 11688 states and 17038 transitions. Second operand 3 states. [2019-10-02 13:05:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:05:27,334 INFO L93 Difference]: Finished difference Result 25166 states and 37380 transitions. [2019-10-02 13:05:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:05:27,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-10-02 13:05:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:05:27,383 INFO L225 Difference]: With dead ends: 25166 [2019-10-02 13:05:27,384 INFO L226 Difference]: Without dead ends: 13596 [2019-10-02 13:05:27,413 INFO L640 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-10-02 13:05:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13596 states. [2019-10-02 13:05:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13596 to 13590. [2019-10-02 13:05:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13590 states. [2019-10-02 13:05:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13590 states to 13590 states and 20427 transitions. [2019-10-02 13:05:27,836 INFO L78 Accepts]: Start accepts. Automaton has 13590 states and 20427 transitions. Word has length 200 [2019-10-02 13:05:27,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:27,836 INFO L475 AbstractCegarLoop]: Abstraction has 13590 states and 20427 transitions. [2019-10-02 13:05:27,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:05:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 13590 states and 20427 transitions. [2019-10-02 13:05:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 13:05:27,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:27,851 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:05:27,851 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:27,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:27,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1160357708, now seen corresponding path program 1 times [2019-10-02 13:05:27,851 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:27,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:27,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:05:28,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:05:28,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:05:28,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:05:28,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:05:28,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:05:28,192 INFO L87 Difference]: Start difference. First operand 13590 states and 20427 transitions. Second operand 3 states. [2019-10-02 13:05:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:05:28,620 INFO L93 Difference]: Finished difference Result 30710 states and 47238 transitions. [2019-10-02 13:05:28,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:05:28,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-10-02 13:05:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:05:28,663 INFO L225 Difference]: With dead ends: 30710 [2019-10-02 13:05:28,664 INFO L226 Difference]: Without dead ends: 17250 [2019-10-02 13:05:28,688 INFO L640 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-10-02 13:05:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17250 states. [2019-10-02 13:05:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17250 to 17244. [2019-10-02 13:05:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17244 states. [2019-10-02 13:05:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17244 states to 17244 states and 26864 transitions. [2019-10-02 13:05:29,253 INFO L78 Accepts]: Start accepts. Automaton has 17244 states and 26864 transitions. Word has length 201 [2019-10-02 13:05:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:29,254 INFO L475 AbstractCegarLoop]: Abstraction has 17244 states and 26864 transitions. [2019-10-02 13:05:29,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:05:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 17244 states and 26864 transitions. [2019-10-02 13:05:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 13:05:29,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:29,288 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:05:29,289 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:29,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:29,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2107781243, now seen corresponding path program 1 times [2019-10-02 13:05:29,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:29,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:29,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:29,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:29,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:05:29,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:05:29,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:05:29,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:05:29,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:05:29,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:05:29,421 INFO L87 Difference]: Start difference. First operand 17244 states and 26864 transitions. Second operand 3 states. [2019-10-02 13:05:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:05:30,144 INFO L93 Difference]: Finished difference Result 41364 states and 66144 transitions. [2019-10-02 13:05:30,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:05:30,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-10-02 13:05:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:05:30,209 INFO L225 Difference]: With dead ends: 41364 [2019-10-02 13:05:30,209 INFO L226 Difference]: Without dead ends: 24260 [2019-10-02 13:05:30,245 INFO L640 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-10-02 13:05:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24260 states. [2019-10-02 13:05:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24260 to 24254. [2019-10-02 13:05:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24254 states. [2019-10-02 13:05:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24254 states to 24254 states and 39249 transitions. [2019-10-02 13:05:31,341 INFO L78 Accepts]: Start accepts. Automaton has 24254 states and 39249 transitions. Word has length 202 [2019-10-02 13:05:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:31,341 INFO L475 AbstractCegarLoop]: Abstraction has 24254 states and 39249 transitions. [2019-10-02 13:05:31,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:05:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 24254 states and 39249 transitions. [2019-10-02 13:05:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 13:05:31,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:31,385 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:05:31,385 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:31,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:31,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1895310028, now seen corresponding path program 1 times [2019-10-02 13:05:31,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:31,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:31,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:05:31,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:05:31,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:05:31,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:05:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:05:31,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:05:31,511 INFO L87 Difference]: Start difference. First operand 24254 states and 39249 transitions. Second operand 3 states. [2019-10-02 13:05:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:05:32,486 INFO L93 Difference]: Finished difference Result 61811 states and 102138 transitions. [2019-10-02 13:05:32,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:05:32,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-10-02 13:05:32,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:05:32,618 INFO L225 Difference]: With dead ends: 61811 [2019-10-02 13:05:32,618 INFO L226 Difference]: Without dead ends: 37704 [2019-10-02 13:05:32,668 INFO L640 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-10-02 13:05:32,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37704 states. [2019-10-02 13:05:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37704 to 37698. [2019-10-02 13:05:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37698 states. [2019-10-02 13:05:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37698 states to 37698 states and 62676 transitions. [2019-10-02 13:05:34,331 INFO L78 Accepts]: Start accepts. Automaton has 37698 states and 62676 transitions. Word has length 203 [2019-10-02 13:05:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:34,332 INFO L475 AbstractCegarLoop]: Abstraction has 37698 states and 62676 transitions. [2019-10-02 13:05:34,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:05:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 37698 states and 62676 transitions. [2019-10-02 13:05:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 13:05:34,414 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:34,414 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:05:34,414 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:34,414 INFO L82 PathProgramCache]: Analyzing trace with hash -103681797, now seen corresponding path program 1 times [2019-10-02 13:05:34,414 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:34,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:34,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:34,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:34,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:05:34,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:05:34,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:05:34,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:05:34,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:05:34,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:05:34,532 INFO L87 Difference]: Start difference. First operand 37698 states and 62676 transitions. Second operand 3 states. [2019-10-02 13:05:37,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:05:37,921 INFO L93 Difference]: Finished difference Result 100977 states and 170676 transitions. [2019-10-02 13:05:37,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:05:37,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-02 13:05:37,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:05:38,132 INFO L225 Difference]: With dead ends: 100977 [2019-10-02 13:05:38,133 INFO L226 Difference]: Without dead ends: 63434 [2019-10-02 13:05:38,231 INFO L640 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-10-02 13:05:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63434 states. [2019-10-02 13:05:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63434 to 63428. [2019-10-02 13:05:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63428 states. [2019-10-02 13:05:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63428 states to 63428 states and 107413 transitions. [2019-10-02 13:05:41,064 INFO L78 Accepts]: Start accepts. Automaton has 63428 states and 107413 transitions. Word has length 204 [2019-10-02 13:05:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:41,064 INFO L475 AbstractCegarLoop]: Abstraction has 63428 states and 107413 transitions. [2019-10-02 13:05:41,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:05:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 63428 states and 107413 transitions. [2019-10-02 13:05:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 13:05:41,216 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:41,216 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-10-02 13:05:41,216 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:41,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:41,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1517803956, now seen corresponding path program 1 times [2019-10-02 13:05:41,217 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:41,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:41,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:41,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:41,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:05:41,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:05:41,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:05:41,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:05:41,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:05:41,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:05:41,352 INFO L87 Difference]: Start difference. First operand 63428 states and 107413 transitions. Second operand 3 states. [2019-10-02 13:05:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:05:46,552 INFO L93 Difference]: Finished difference Result 175857 states and 299502 transitions. [2019-10-02 13:05:46,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:05:46,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-02 13:05:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:05:47,031 INFO L225 Difference]: With dead ends: 175857 [2019-10-02 13:05:47,032 INFO L226 Difference]: Without dead ends: 112592 [2019-10-02 13:05:47,179 INFO L640 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-10-02 13:05:47,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112592 states. [2019-10-02 13:05:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112592 to 112586. [2019-10-02 13:05:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112586 states. [2019-10-02 13:05:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112586 states to 112586 states and 190746 transitions. [2019-10-02 13:05:54,560 INFO L78 Accepts]: Start accepts. Automaton has 112586 states and 190746 transitions. Word has length 205 [2019-10-02 13:05:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:54,561 INFO L475 AbstractCegarLoop]: Abstraction has 112586 states and 190746 transitions. [2019-10-02 13:05:54,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:05:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 112586 states and 190746 transitions. [2019-10-02 13:05:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 13:05:54,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:54,777 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:05:54,777 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:54,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:54,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1699468933, now seen corresponding path program 1 times [2019-10-02 13:05:54,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:54,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:54,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:54,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:54,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:05:54,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:05:54,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:05:54,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:05:54,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:05:54,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:05:54,900 INFO L87 Difference]: Start difference. First operand 112586 states and 190746 transitions. Second operand 3 states. [2019-10-02 13:06:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:06:04,195 INFO L93 Difference]: Finished difference Result 318700 states and 541796 transitions. [2019-10-02 13:06:04,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:06:04,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-10-02 13:06:04,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:06:04,779 INFO L225 Difference]: With dead ends: 318700 [2019-10-02 13:06:04,779 INFO L226 Difference]: Without dead ends: 206290 [2019-10-02 13:06:04,957 INFO L640 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-10-02 13:06:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206290 states. [2019-10-02 13:06:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206290 to 206284. [2019-10-02 13:06:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206284 states. [2019-10-02 13:06:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206284 states to 206284 states and 348187 transitions. [2019-10-02 13:06:18,854 INFO L78 Accepts]: Start accepts. Automaton has 206284 states and 348187 transitions. Word has length 206 [2019-10-02 13:06:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:06:18,854 INFO L475 AbstractCegarLoop]: Abstraction has 206284 states and 348187 transitions. [2019-10-02 13:06:18,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:06:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 206284 states and 348187 transitions. [2019-10-02 13:06:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 13:06:19,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:06:19,283 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:06:19,284 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:06:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:06:19,284 INFO L82 PathProgramCache]: Analyzing trace with hash 34714060, now seen corresponding path program 1 times [2019-10-02 13:06:19,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:06:19,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:06:19,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:06:19,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:06:19,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:06:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:06:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:06:19,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:06:19,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:06:19,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:06:19,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:06:19,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:06:19,443 INFO L87 Difference]: Start difference. First operand 206284 states and 348187 transitions. Second operand 3 states. [2019-10-02 13:06:35,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:06:35,540 INFO L93 Difference]: Finished difference Result 389186 states and 651780 transitions. [2019-10-02 13:06:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:06:35,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-10-02 13:06:35,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:06:36,785 INFO L225 Difference]: With dead ends: 389186 [2019-10-02 13:06:36,786 INFO L226 Difference]: Without dead ends: 380806 [2019-10-02 13:06:36,892 INFO L640 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-10-02 13:06:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380806 states. [2019-10-02 13:07:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380806 to 380800. [2019-10-02 13:07:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380800 states. [2019-10-02 13:07:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380800 states to 380800 states and 634155 transitions. [2019-10-02 13:07:09,076 INFO L78 Accepts]: Start accepts. Automaton has 380800 states and 634155 transitions. Word has length 207 [2019-10-02 13:07:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:07:09,076 INFO L475 AbstractCegarLoop]: Abstraction has 380800 states and 634155 transitions. [2019-10-02 13:07:09,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:07:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 380800 states and 634155 transitions. [2019-10-02 13:07:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 13:07:09,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:07:09,668 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:07:09,669 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:07:09,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:07:09,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1664034309, now seen corresponding path program 1 times [2019-10-02 13:07:09,670 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:07:09,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:07:09,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:07:09,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:07:09,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:07:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:07:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:07:09,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:07:09,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:07:09,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:07:09,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:07:09,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:07:09,963 INFO L87 Difference]: Start difference. First operand 380800 states and 634155 transitions. Second operand 3 states. [2019-10-02 13:07:30,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:07:30,192 INFO L93 Difference]: Finished difference Result 390472 states and 647543 transitions. [2019-10-02 13:07:30,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:07:30,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-10-02 13:07:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:07:32,413 INFO L225 Difference]: With dead ends: 390472 [2019-10-02 13:07:32,413 INFO L226 Difference]: Without dead ends: 382252 [2019-10-02 13:07:32,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-10-02 13:07:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382252 states. [2019-10-02 13:08:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382252 to 380107. [2019-10-02 13:08:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380107 states. [2019-10-02 13:08:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380107 states to 380107 states and 633114 transitions. [2019-10-02 13:08:09,562 INFO L78 Accepts]: Start accepts. Automaton has 380107 states and 633114 transitions. Word has length 208 [2019-10-02 13:08:09,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:08:09,563 INFO L475 AbstractCegarLoop]: Abstraction has 380107 states and 633114 transitions. [2019-10-02 13:08:09,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:08:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 380107 states and 633114 transitions. [2019-10-02 13:08:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-10-02 13:08:11,388 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:08:11,388 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 13:08:11,389 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:08:11,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:08:11,389 INFO L82 PathProgramCache]: Analyzing trace with hash 818994576, now seen corresponding path program 1 times [2019-10-02 13:08:11,389 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:08:11,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:08:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:08:11,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:08:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:08:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:08:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 13:08:11,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:08:11,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:08:11,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:08:11,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:08:11,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:08:11,639 INFO L87 Difference]: Start difference. First operand 380107 states and 633114 transitions. Second operand 6 states. [2019-10-02 13:08:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:08:51,752 INFO L93 Difference]: Finished difference Result 754640 states and 1261466 transitions. [2019-10-02 13:08:51,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:08:51,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 361 [2019-10-02 13:08:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:08:54,324 INFO L225 Difference]: With dead ends: 754640 [2019-10-02 13:08:54,324 INFO L226 Difference]: Without dead ends: 747395 [2019-10-02 13:08:54,527 INFO L640 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-10-02 13:08:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747395 states. [2019-10-02 13:10:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747395 to 747274. [2019-10-02 13:10:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747274 states. [2019-10-02 13:10:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747274 states to 747274 states and 1251432 transitions. [2019-10-02 13:10:14,380 INFO L78 Accepts]: Start accepts. Automaton has 747274 states and 1251432 transitions. Word has length 361 [2019-10-02 13:10:14,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:10:14,381 INFO L475 AbstractCegarLoop]: Abstraction has 747274 states and 1251432 transitions. [2019-10-02 13:10:14,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:10:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 747274 states and 1251432 transitions. [2019-10-02 13:10:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-10-02 13:10:33,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:10:33,397 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 13:10:33,397 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:10:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:10:33,398 INFO L82 PathProgramCache]: Analyzing trace with hash 802472984, now seen corresponding path program 1 times [2019-10-02 13:10:33,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:10:33,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:10:33,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:10:33,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:10:33,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:10:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:10:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 13:10:33,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:10:33,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:10:33,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:10:33,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:10:33,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:10:33,682 INFO L87 Difference]: Start difference. First operand 747274 states and 1251432 transitions. Second operand 11 states. [2019-10-02 13:11:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:11:06,573 INFO L93 Difference]: Finished difference Result 761288 states and 1270335 transitions. [2019-10-02 13:11:06,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:11:06,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 362 [2019-10-02 13:11:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:11:09,178 INFO L225 Difference]: With dead ends: 761288 [2019-10-02 13:11:09,178 INFO L226 Difference]: Without dead ends: 746557 [2019-10-02 13:11:09,400 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:11:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746557 states. [2019-10-02 13:12:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746557 to 746441. [2019-10-02 13:12:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746441 states. [2019-10-02 13:12:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746441 states to 746441 states and 1250047 transitions. [2019-10-02 13:12:25,832 INFO L78 Accepts]: Start accepts. Automaton has 746441 states and 1250047 transitions. Word has length 362 [2019-10-02 13:12:25,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:25,833 INFO L475 AbstractCegarLoop]: Abstraction has 746441 states and 1250047 transitions. [2019-10-02 13:12:25,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:12:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 746441 states and 1250047 transitions. [2019-10-02 13:12:42,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-10-02 13:12:42,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:42,243 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 13:12:42,243 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:42,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:42,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1595752274, now seen corresponding path program 1 times [2019-10-02 13:12:42,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:42,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:42,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:42,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:42,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-02 13:12:43,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:43,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:12:43,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:12:43,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:12:43,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:12:43,816 INFO L87 Difference]: Start difference. First operand 746441 states and 1250047 transitions. Second operand 6 states.