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_spec3_product17.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:59:34,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:59:34,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:59:34,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:59:34,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:59:34,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:59:34,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:59:34,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:59:34,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:59:34,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:59:34,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:59:34,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:59:34,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:59:34,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:59:34,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:59:34,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:59:34,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:59:34,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:59:34,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:59:34,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:59:34,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:59:34,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:59:34,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:59:34,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:59:34,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:59:34,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:59:34,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:59:34,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:59:34,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:59:34,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:59:34,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:59:34,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:59:34,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:59:34,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:59:34,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:59:34,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:59:34,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:59:34,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:59:34,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:59:34,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:59:34,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:59:34,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:59:34,502 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:59:34,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:59:34,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:59:34,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:59:34,504 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:59:34,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:59:34,504 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:59:34,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:59:34,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:59:34,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:59:34,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:59:34,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:59:34,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:59:34,506 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:59:34,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:59:34,506 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:59:34,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:59:34,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:59:34,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:59:34,507 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:59:34,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:59:34,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:59:34,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:59:34,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:59:34,508 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:59:34,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:59:34,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:59:34,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:59:34,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:59:34,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:59:34,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:59:34,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:59:34,556 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:59:34,556 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:59:34,557 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec3_product17.cil.c [2019-09-08 04:59:34,618 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a138caf0/2261414745154ba0bbc908117fdc9b20/FLAGc3a5b6645 [2019-09-08 04:59:35,271 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:59:35,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec3_product17.cil.c [2019-09-08 04:59:35,295 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a138caf0/2261414745154ba0bbc908117fdc9b20/FLAGc3a5b6645 [2019-09-08 04:59:35,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a138caf0/2261414745154ba0bbc908117fdc9b20 [2019-09-08 04:59:35,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:59:35,515 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:59:35,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:59:35,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:59:35,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:59:35,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:59:35" (1/1) ... [2019-09-08 04:59:35,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ffcf0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:35, skipping insertion in model container [2019-09-08 04:59:35,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:59:35" (1/1) ... [2019-09-08 04:59:35,532 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:59:35,616 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:59:36,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:59:36,423 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:59:36,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:59:36,682 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:59:36,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:36 WrapperNode [2019-09-08 04:59:36,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:59:36,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:59:36,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:59:36,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:59:36,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:36" (1/1) ... [2019-09-08 04:59:36,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:36" (1/1) ... [2019-09-08 04:59:36,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:36" (1/1) ... [2019-09-08 04:59:36,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:36" (1/1) ... [2019-09-08 04:59:36,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:36" (1/1) ... [2019-09-08 04:59:36,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:36" (1/1) ... [2019-09-08 04:59:36,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:36" (1/1) ... [2019-09-08 04:59:36,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:59:36,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:59:36,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:59:36,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:59:36,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:59:36,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:59:36,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:59:36,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:59:36,971 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:59:36,971 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:59:36,971 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:59:36,971 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:59:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:59:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:59:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:59:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:59:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:59:36,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:59:36,973 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:59:36,973 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:59:36,973 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:59:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:59:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:59:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:59:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:59:36,975 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:59:36,975 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:59:36,975 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 04:59:36,976 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:59:36,976 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:59:36,976 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:59:36,976 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:59:36,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:59:36,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:59:36,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:59:36,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:59:36,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:59:36,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:59:36,977 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:59:36,978 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:59:36,978 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:59:36,978 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 04:59:36,978 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:59:36,978 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:59:36,978 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 04:59:36,979 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:59:36,979 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:59:36,979 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:59:36,979 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:59:36,979 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:59:36,980 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:59:36,980 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:59:36,980 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:59:36,980 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:59:36,980 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 04:59:36,980 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 04:59:36,981 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 04:59:36,981 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:59:36,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__1 [2019-09-08 04:59:36,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__2 [2019-09-08 04:59:36,981 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:59:36,981 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:59:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:59:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:59:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:59:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:59:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:59:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:59:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:59:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:59:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:59:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:59:36,984 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:59:36,984 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:59:36,984 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:59:36,984 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:59:36,984 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:59:36,984 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:59:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:59:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:59:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:59:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:59:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:59:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:59:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:59:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:59:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:59:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:59:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:59:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 04:59:36,986 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-08 04:59:36,987 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:59:36,987 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:59:36,987 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:59:36,987 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:59:36,987 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:59:36,987 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:59:36,987 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:59:36,988 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:59:36,988 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:59:36,988 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:59:36,988 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:59:36,988 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:59:36,988 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:59:36,989 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:59:36,989 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:59:36,989 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:59:36,989 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:59:36,989 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:59:36,989 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:59:36,989 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:59:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:59:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:59:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:59:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:59:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:59:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:59:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:59:36,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:59:36,991 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:59:36,991 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:59:36,991 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:59:36,991 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:59:36,991 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:59:36,991 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:59:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:59:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:59:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:59:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:59:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:59:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:59:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:59:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:59:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:59:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:59:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:59:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:59:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:59:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:59:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:59:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:59:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:59:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:59:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:59:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:59:36,995 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:59:36,995 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:59:36,995 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:59:36,995 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:59:36,995 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:59:36,995 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:59:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:59:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:59:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:59:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:59:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:59:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:59:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 04:59:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:59:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:59:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:59:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:59:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:59:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:59:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:59:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:59:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:59:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:59:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:59:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:59:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:59:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:59:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:59:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:59:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:59:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:59:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:59:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:59:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:59:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:59:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:59:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:59:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:59:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:59:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:59:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:59:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:59:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:59:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:59:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:59:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:59:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:59:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:59:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:59:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:59:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:59:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:59:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:59:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:59:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:59:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:59:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:59:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 04:59:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 04:59:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 04:59:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__1 [2019-09-08 04:59:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:59:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 04:59:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 04:59:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__2 [2019-09-08 04:59:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:59:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:59:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:59:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:59:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:59:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:59:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:59:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:59:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:59:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:59:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:59:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:59:37,005 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:59:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:59:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:59:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:59:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:59:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:59:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:59:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 04:59:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-08 04:59:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:59:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:59:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:59:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:59:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:59:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:59:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:59:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:59:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:59:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:59:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:59:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:59:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:59:39,085 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:59:39,085 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:59:39,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:59:39 BoogieIcfgContainer [2019-09-08 04:59:39,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:59:39,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:59:39,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:59:39,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:59:39,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:59:35" (1/3) ... [2019-09-08 04:59:39,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e28805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:59:39, skipping insertion in model container [2019-09-08 04:59:39,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:36" (2/3) ... [2019-09-08 04:59:39,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e28805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:59:39, skipping insertion in model container [2019-09-08 04:59:39,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:59:39" (3/3) ... [2019-09-08 04:59:39,096 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec3_product17.cil.c [2019-09-08 04:59:39,106 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:59:39,120 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:59:39,138 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:59:39,189 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:59:39,190 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:59:39,190 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:59:39,190 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:59:39,190 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:59:39,190 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:59:39,190 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:59:39,191 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:59:39,191 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:59:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states. [2019-09-08 04:59:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 04:59:39,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:39,247 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:39,249 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:39,255 INFO L82 PathProgramCache]: Analyzing trace with hash 219743261, now seen corresponding path program 1 times [2019-09-08 04:59:39,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:39,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:39,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:59:39,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:39,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:59:39,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:59:39,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:59:39,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:59:39,929 INFO L87 Difference]: Start difference. First operand 552 states. Second operand 2 states. [2019-09-08 04:59:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:40,014 INFO L93 Difference]: Finished difference Result 757 states and 1036 transitions. [2019-09-08 04:59:40,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:59:40,016 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 179 [2019-09-08 04:59:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:40,042 INFO L225 Difference]: With dead ends: 757 [2019-09-08 04:59:40,042 INFO L226 Difference]: Without dead ends: 501 [2019-09-08 04:59:40,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:59:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-09-08 04:59:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2019-09-08 04:59:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-08 04:59:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 688 transitions. [2019-09-08 04:59:40,200 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 688 transitions. Word has length 179 [2019-09-08 04:59:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:40,205 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 688 transitions. [2019-09-08 04:59:40,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:59:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 688 transitions. [2019-09-08 04:59:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 04:59:40,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:40,220 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:40,220 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:40,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1078894523, now seen corresponding path program 1 times [2019-09-08 04:59:40,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:40,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:40,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:40,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:40,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:59:40,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:40,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:59:40,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:59:40,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:59:40,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:59:40,500 INFO L87 Difference]: Start difference. First operand 501 states and 688 transitions. Second operand 3 states. [2019-09-08 04:59:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:40,578 INFO L93 Difference]: Finished difference Result 740 states and 998 transitions. [2019-09-08 04:59:40,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:59:40,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 04:59:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:40,589 INFO L225 Difference]: With dead ends: 740 [2019-09-08 04:59:40,589 INFO L226 Difference]: Without dead ends: 504 [2019-09-08 04:59:40,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:59:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-08 04:59:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 503. [2019-09-08 04:59:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-08 04:59:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 690 transitions. [2019-09-08 04:59:40,644 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 690 transitions. Word has length 180 [2019-09-08 04:59:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:40,645 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 690 transitions. [2019-09-08 04:59:40,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:59:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 690 transitions. [2019-09-08 04:59:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 04:59:40,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:40,654 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:40,654 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:40,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1911048495, now seen corresponding path program 1 times [2019-09-08 04:59:40,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:40,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:40,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:40,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:40,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:59:40,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:40,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:59:40,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:59:40,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:59:40,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:59:40,904 INFO L87 Difference]: Start difference. First operand 503 states and 690 transitions. Second operand 3 states. [2019-09-08 04:59:40,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:40,948 INFO L93 Difference]: Finished difference Result 982 states and 1378 transitions. [2019-09-08 04:59:40,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:59:40,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-08 04:59:40,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:40,956 INFO L225 Difference]: With dead ends: 982 [2019-09-08 04:59:40,956 INFO L226 Difference]: Without dead ends: 544 [2019-09-08 04:59:40,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:59:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-08 04:59:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 543. [2019-09-08 04:59:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-08 04:59:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 759 transitions. [2019-09-08 04:59:40,988 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 759 transitions. Word has length 186 [2019-09-08 04:59:40,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:40,988 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 759 transitions. [2019-09-08 04:59:40,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:59:40,989 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 759 transitions. [2019-09-08 04:59:40,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 04:59:40,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:40,993 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:40,994 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:40,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:40,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1885803783, now seen corresponding path program 1 times [2019-09-08 04:59:40,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:40,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:40,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:40,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:40,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:59:41,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:41,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:59:41,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:59:41,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:59:41,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:59:41,286 INFO L87 Difference]: Start difference. First operand 543 states and 759 transitions. Second operand 12 states. [2019-09-08 04:59:52,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:52,280 INFO L93 Difference]: Finished difference Result 2495 states and 3490 transitions. [2019-09-08 04:59:52,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 04:59:52,281 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 187 [2019-09-08 04:59:52,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:52,308 INFO L225 Difference]: With dead ends: 2495 [2019-09-08 04:59:52,309 INFO L226 Difference]: Without dead ends: 2260 [2019-09-08 04:59:52,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=1515, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 04:59:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-09-08 04:59:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 2235. [2019-09-08 04:59:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2019-09-08 04:59:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 3060 transitions. [2019-09-08 04:59:52,508 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 3060 transitions. Word has length 187 [2019-09-08 04:59:52,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:52,510 INFO L475 AbstractCegarLoop]: Abstraction has 2235 states and 3060 transitions. [2019-09-08 04:59:52,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:59:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 3060 transitions. [2019-09-08 04:59:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 04:59:52,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:52,518 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:52,518 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:52,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash 380936231, now seen corresponding path program 1 times [2019-09-08 04:59:52,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:52,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:52,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:52,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:52,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:59:53,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:53,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 04:59:53,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:59:53,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:59:53,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:59:53,175 INFO L87 Difference]: Start difference. First operand 2235 states and 3060 transitions. Second operand 18 states. [2019-09-08 04:59:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:53,666 INFO L93 Difference]: Finished difference Result 3941 states and 5444 transitions. [2019-09-08 04:59:53,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 04:59:53,667 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 188 [2019-09-08 04:59:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:53,689 INFO L225 Difference]: With dead ends: 3941 [2019-09-08 04:59:53,689 INFO L226 Difference]: Without dead ends: 1996 [2019-09-08 04:59:53,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:59:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-09-08 04:59:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1994. [2019-09-08 04:59:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-09-08 04:59:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2733 transitions. [2019-09-08 04:59:53,830 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2733 transitions. Word has length 188 [2019-09-08 04:59:53,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:53,832 INFO L475 AbstractCegarLoop]: Abstraction has 1994 states and 2733 transitions. [2019-09-08 04:59:53,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:59:53,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2733 transitions. [2019-09-08 04:59:53,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 04:59:53,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:53,838 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:53,838 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:53,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:53,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1635559321, now seen corresponding path program 1 times [2019-09-08 04:59:53,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:53,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:53,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:53,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:53,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:59:54,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:59:54,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:59:54,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:54,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 2725 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:59:54,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:59:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 04:59:54,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:59:54,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 04:59:54,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:59:54,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:59:54,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:59:54,995 INFO L87 Difference]: Start difference. First operand 1994 states and 2733 transitions. Second operand 13 states. [2019-09-08 04:59:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:56,697 INFO L93 Difference]: Finished difference Result 3970 states and 5456 transitions. [2019-09-08 04:59:56,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:59:56,698 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 197 [2019-09-08 04:59:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:56,713 INFO L225 Difference]: With dead ends: 3970 [2019-09-08 04:59:56,714 INFO L226 Difference]: Without dead ends: 2012 [2019-09-08 04:59:56,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:59:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2019-09-08 04:59:56,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 2010. [2019-09-08 04:59:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2019-09-08 04:59:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 2754 transitions. [2019-09-08 04:59:56,842 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 2754 transitions. Word has length 197 [2019-09-08 04:59:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:56,843 INFO L475 AbstractCegarLoop]: Abstraction has 2010 states and 2754 transitions. [2019-09-08 04:59:56,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:59:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2754 transitions. [2019-09-08 04:59:56,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 04:59:56,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:56,848 INFO L399 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] [2019-09-08 04:59:56,848 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:56,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1181635200, now seen corresponding path program 1 times [2019-09-08 04:59:56,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:56,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:56,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:56,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:56,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:59:57,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:57,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:59:57,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:59:57,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:59:57,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:59:57,116 INFO L87 Difference]: Start difference. First operand 2010 states and 2754 transitions. Second operand 7 states. [2019-09-08 04:59:57,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:57,490 INFO L93 Difference]: Finished difference Result 3968 states and 5445 transitions. [2019-09-08 04:59:57,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:59:57,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2019-09-08 04:59:57,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:57,509 INFO L225 Difference]: With dead ends: 3968 [2019-09-08 04:59:57,509 INFO L226 Difference]: Without dead ends: 2024 [2019-09-08 04:59:57,519 INFO L628 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-09-08 04:59:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2019-09-08 04:59:57,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 2020. [2019-09-08 04:59:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-09-08 04:59:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2765 transitions. [2019-09-08 04:59:57,660 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2765 transitions. Word has length 199 [2019-09-08 04:59:57,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:57,661 INFO L475 AbstractCegarLoop]: Abstraction has 2020 states and 2765 transitions. [2019-09-08 04:59:57,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:59:57,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2765 transitions. [2019-09-08 04:59:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 04:59:57,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:57,669 INFO L399 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-09-08 04:59:57,670 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:57,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:57,671 INFO L82 PathProgramCache]: Analyzing trace with hash -77841247, now seen corresponding path program 2 times [2019-09-08 04:59:57,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:57,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:57,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:57,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:57,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:59:57,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:57,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:59:57,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:59:57,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:59:57,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:59:57,924 INFO L87 Difference]: Start difference. First operand 2020 states and 2765 transitions. Second operand 7 states. [2019-09-08 04:59:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:58,355 INFO L93 Difference]: Finished difference Result 3966 states and 5444 transitions. [2019-09-08 04:59:58,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:59:58,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-09-08 04:59:58,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:58,371 INFO L225 Difference]: With dead ends: 3966 [2019-09-08 04:59:58,372 INFO L226 Difference]: Without dead ends: 2026 [2019-09-08 04:59:58,381 INFO L628 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-09-08 04:59:58,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-09-08 04:59:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2022. [2019-09-08 04:59:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2019-09-08 04:59:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2768 transitions. [2019-09-08 04:59:58,495 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2768 transitions. Word has length 200 [2019-09-08 04:59:58,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:58,497 INFO L475 AbstractCegarLoop]: Abstraction has 2022 states and 2768 transitions. [2019-09-08 04:59:58,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:59:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2768 transitions. [2019-09-08 04:59:58,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 04:59:58,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:58,502 INFO L399 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-09-08 04:59:58,503 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:58,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:58,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1294112837, now seen corresponding path program 1 times [2019-09-08 04:59:58,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:58,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:58,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:58,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:59:58,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:59:58,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:58,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:59:58,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:59:58,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:59:58,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:59:58,701 INFO L87 Difference]: Start difference. First operand 2022 states and 2768 transitions. Second operand 9 states. [2019-09-08 04:59:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:59,036 INFO L93 Difference]: Finished difference Result 3971 states and 5450 transitions. [2019-09-08 04:59:59,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:59:59,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 201 [2019-09-08 04:59:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:59,048 INFO L225 Difference]: With dead ends: 3971 [2019-09-08 04:59:59,049 INFO L226 Difference]: Without dead ends: 2024 [2019-09-08 04:59:59,056 INFO L628 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-09-08 04:59:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2019-09-08 04:59:59,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 2022. [2019-09-08 04:59:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2019-09-08 04:59:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2767 transitions. [2019-09-08 04:59:59,162 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2767 transitions. Word has length 201 [2019-09-08 04:59:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:59,163 INFO L475 AbstractCegarLoop]: Abstraction has 2022 states and 2767 transitions. [2019-09-08 04:59:59,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:59:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2767 transitions. [2019-09-08 04:59:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 04:59:59,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:59,168 INFO L399 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, 1] [2019-09-08 04:59:59,168 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:59,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:59,169 INFO L82 PathProgramCache]: Analyzing trace with hash 99080201, now seen corresponding path program 2 times [2019-09-08 04:59:59,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:59,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:59,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:59:59,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:59:59,880 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:59:59,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 05:00:00,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:00:00,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:00:00,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 2730 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:00:00,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:00:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 05:00:00,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:00:00,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [28] total 35 [2019-09-08 05:00:00,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 05:00:00,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 05:00:00,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1118, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 05:00:00,708 INFO L87 Difference]: Start difference. First operand 2022 states and 2767 transitions. Second operand 35 states. [2019-09-08 05:00:34,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:34,307 INFO L93 Difference]: Finished difference Result 11965 states and 16597 transitions. [2019-09-08 05:00:34,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 05:00:34,308 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 202 [2019-09-08 05:00:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:34,392 INFO L225 Difference]: With dead ends: 11965 [2019-09-08 05:00:34,392 INFO L226 Difference]: Without dead ends: 10023 [2019-09-08 05:00:34,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2495 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=969, Invalid=10161, Unknown=0, NotChecked=0, Total=11130 [2019-09-08 05:00:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10023 states. [2019-09-08 05:00:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10023 to 6297. [2019-09-08 05:00:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6297 states. [2019-09-08 05:00:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6297 states to 6297 states and 8862 transitions. [2019-09-08 05:00:35,190 INFO L78 Accepts]: Start accepts. Automaton has 6297 states and 8862 transitions. Word has length 202 [2019-09-08 05:00:35,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:35,191 INFO L475 AbstractCegarLoop]: Abstraction has 6297 states and 8862 transitions. [2019-09-08 05:00:35,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 05:00:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 6297 states and 8862 transitions. [2019-09-08 05:00:35,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 05:00:35,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:35,202 INFO L399 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, 1, 1] [2019-09-08 05:00:35,202 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:35,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:35,203 INFO L82 PathProgramCache]: Analyzing trace with hash -608753781, now seen corresponding path program 1 times [2019-09-08 05:00:35,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:35,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:35,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:35,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:00:35,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:00:35,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:35,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 05:00:35,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:00:35,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:00:35,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:00:35,656 INFO L87 Difference]: Start difference. First operand 6297 states and 8862 transitions. Second operand 22 states. [2019-09-08 05:00:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:36,480 INFO L93 Difference]: Finished difference Result 9971 states and 13985 transitions. [2019-09-08 05:00:36,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 05:00:36,481 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 203 [2019-09-08 05:00:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:36,534 INFO L225 Difference]: With dead ends: 9971 [2019-09-08 05:00:36,534 INFO L226 Difference]: Without dead ends: 6645 [2019-09-08 05:00:36,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:00:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6645 states. [2019-09-08 05:00:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6645 to 6601. [2019-09-08 05:00:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6601 states. [2019-09-08 05:00:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 9310 transitions. [2019-09-08 05:00:36,894 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 9310 transitions. Word has length 203 [2019-09-08 05:00:36,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:36,896 INFO L475 AbstractCegarLoop]: Abstraction has 6601 states and 9310 transitions. [2019-09-08 05:00:36,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:00:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 9310 transitions. [2019-09-08 05:00:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 05:00:36,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:36,909 INFO L399 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, 1, 1] [2019-09-08 05:00:36,909 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:36,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:36,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1503307474, now seen corresponding path program 1 times [2019-09-08 05:00:36,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:36,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:36,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:36,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:36,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 05:00:37,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:37,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:00:37,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:00:37,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:00:37,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:00:37,096 INFO L87 Difference]: Start difference. First operand 6601 states and 9310 transitions. Second operand 9 states. [2019-09-08 05:00:37,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:37,565 INFO L93 Difference]: Finished difference Result 13073 states and 18466 transitions. [2019-09-08 05:00:37,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:00:37,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 203 [2019-09-08 05:00:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:37,607 INFO L225 Difference]: With dead ends: 13073 [2019-09-08 05:00:37,608 INFO L226 Difference]: Without dead ends: 6597 [2019-09-08 05:00:37,630 INFO L628 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-09-08 05:00:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6597 states. [2019-09-08 05:00:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6597 to 6587. [2019-09-08 05:00:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6587 states. [2019-09-08 05:00:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6587 states to 6587 states and 9288 transitions. [2019-09-08 05:00:38,037 INFO L78 Accepts]: Start accepts. Automaton has 6587 states and 9288 transitions. Word has length 203 [2019-09-08 05:00:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:38,038 INFO L475 AbstractCegarLoop]: Abstraction has 6587 states and 9288 transitions. [2019-09-08 05:00:38,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:00:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 6587 states and 9288 transitions. [2019-09-08 05:00:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 05:00:38,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:38,048 INFO L399 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, 1, 1] [2019-09-08 05:00:38,048 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash -336235655, now seen corresponding path program 1 times [2019-09-08 05:00:38,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:38,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:38,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:38,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:38,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:38,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:00:38,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:00:38,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:00:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:38,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 2730 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:00:38,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:00:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:00:38,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:00:38,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 05:00:38,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:00:38,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:00:38,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:00:38,715 INFO L87 Difference]: Start difference. First operand 6587 states and 9288 transitions. Second operand 5 states. [2019-09-08 05:00:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:38,988 INFO L93 Difference]: Finished difference Result 12169 states and 17050 transitions. [2019-09-08 05:00:38,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 05:00:38,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 05:00:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:39,016 INFO L225 Difference]: With dead ends: 12169 [2019-09-08 05:00:39,017 INFO L226 Difference]: Without dead ends: 6705 [2019-09-08 05:00:39,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 204 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-09-08 05:00:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2019-09-08 05:00:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 6695. [2019-09-08 05:00:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6695 states. [2019-09-08 05:00:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6695 states to 6695 states and 9466 transitions. [2019-09-08 05:00:39,343 INFO L78 Accepts]: Start accepts. Automaton has 6695 states and 9466 transitions. Word has length 204 [2019-09-08 05:00:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:39,343 INFO L475 AbstractCegarLoop]: Abstraction has 6695 states and 9466 transitions. [2019-09-08 05:00:39,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:00:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 6695 states and 9466 transitions. [2019-09-08 05:00:39,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 05:00:39,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:39,355 INFO L399 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, 1, 1] [2019-09-08 05:00:39,355 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:39,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:39,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1899348534, now seen corresponding path program 1 times [2019-09-08 05:00:39,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:39,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:39,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:39,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:39,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:40,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:40,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:40,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:40,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:40,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:40,059 INFO L87 Difference]: Start difference. First operand 6695 states and 9466 transitions. Second operand 3 states. [2019-09-08 05:00:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:40,276 INFO L93 Difference]: Finished difference Result 13553 states and 19320 transitions. [2019-09-08 05:00:40,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:40,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-08 05:00:40,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:40,309 INFO L225 Difference]: With dead ends: 13553 [2019-09-08 05:00:40,310 INFO L226 Difference]: Without dead ends: 7025 [2019-09-08 05:00:40,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:40,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2019-09-08 05:00:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 7023. [2019-09-08 05:00:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7023 states. [2019-09-08 05:00:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 10038 transitions. [2019-09-08 05:00:40,686 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 10038 transitions. Word has length 210 [2019-09-08 05:00:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:40,687 INFO L475 AbstractCegarLoop]: Abstraction has 7023 states and 10038 transitions. [2019-09-08 05:00:40,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 10038 transitions. [2019-09-08 05:00:40,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 05:00:40,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:40,699 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-09-08 05:00:40,699 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:40,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1257534899, now seen corresponding path program 2 times [2019-09-08 05:00:40,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:40,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:40,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:40,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:40,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:40,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:40,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:00:40,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:00:40,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:00:40,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:00:40,859 INFO L87 Difference]: Start difference. First operand 7023 states and 10038 transitions. Second operand 6 states. [2019-09-08 05:00:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:41,091 INFO L93 Difference]: Finished difference Result 13793 states and 19736 transitions. [2019-09-08 05:00:41,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:00:41,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-09-08 05:00:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:41,120 INFO L225 Difference]: With dead ends: 13793 [2019-09-08 05:00:41,120 INFO L226 Difference]: Without dead ends: 7025 [2019-09-08 05:00:41,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:00:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2019-09-08 05:00:41,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 7023. [2019-09-08 05:00:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7023 states. [2019-09-08 05:00:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 10030 transitions. [2019-09-08 05:00:41,423 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 10030 transitions. Word has length 211 [2019-09-08 05:00:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:41,423 INFO L475 AbstractCegarLoop]: Abstraction has 7023 states and 10030 transitions. [2019-09-08 05:00:41,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:00:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 10030 transitions. [2019-09-08 05:00:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 05:00:41,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:41,435 INFO L399 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, 1, 1, 1] [2019-09-08 05:00:41,435 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:41,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:41,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1825985630, now seen corresponding path program 1 times [2019-09-08 05:00:41,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:41,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:41,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:41,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:00:41,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:41,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:41,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:41,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:41,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:41,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:41,549 INFO L87 Difference]: Start difference. First operand 7023 states and 10030 transitions. Second operand 3 states. [2019-09-08 05:00:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:41,848 INFO L93 Difference]: Finished difference Result 14481 states and 20930 transitions. [2019-09-08 05:00:41,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:41,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-09-08 05:00:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:41,881 INFO L225 Difference]: With dead ends: 14481 [2019-09-08 05:00:41,881 INFO L226 Difference]: Without dead ends: 7637 [2019-09-08 05:00:41,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7637 states. [2019-09-08 05:00:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7637 to 7635. [2019-09-08 05:00:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7635 states. [2019-09-08 05:00:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7635 states to 7635 states and 11092 transitions. [2019-09-08 05:00:42,285 INFO L78 Accepts]: Start accepts. Automaton has 7635 states and 11092 transitions. Word has length 211 [2019-09-08 05:00:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:42,286 INFO L475 AbstractCegarLoop]: Abstraction has 7635 states and 11092 transitions. [2019-09-08 05:00:42,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 7635 states and 11092 transitions. [2019-09-08 05:00:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 05:00:42,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:42,303 INFO L399 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, 1, 1, 1, 1] [2019-09-08 05:00:42,304 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:42,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:42,305 INFO L82 PathProgramCache]: Analyzing trace with hash -852679916, now seen corresponding path program 1 times [2019-09-08 05:00:42,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:42,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:42,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:42,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:42,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:42,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:42,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:42,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:42,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:42,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:42,430 INFO L87 Difference]: Start difference. First operand 7635 states and 11092 transitions. Second operand 3 states. [2019-09-08 05:00:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:42,754 INFO L93 Difference]: Finished difference Result 16255 states and 24002 transitions. [2019-09-08 05:00:42,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:42,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-08 05:00:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:42,783 INFO L225 Difference]: With dead ends: 16255 [2019-09-08 05:00:42,783 INFO L226 Difference]: Without dead ends: 8813 [2019-09-08 05:00:42,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8813 states. [2019-09-08 05:00:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8813 to 8811. [2019-09-08 05:00:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8811 states. [2019-09-08 05:00:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8811 states to 8811 states and 13106 transitions. [2019-09-08 05:00:43,218 INFO L78 Accepts]: Start accepts. Automaton has 8811 states and 13106 transitions. Word has length 212 [2019-09-08 05:00:43,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:43,219 INFO L475 AbstractCegarLoop]: Abstraction has 8811 states and 13106 transitions. [2019-09-08 05:00:43,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 8811 states and 13106 transitions. [2019-09-08 05:00:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 05:00:43,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:43,238 INFO L399 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, 1, 1, 1, 1, 1] [2019-09-08 05:00:43,238 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:43,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:43,239 INFO L82 PathProgramCache]: Analyzing trace with hash 152512702, now seen corresponding path program 1 times [2019-09-08 05:00:43,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:43,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:43,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:43,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:43,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:43,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:43,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:43,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:43,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:43,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:43,480 INFO L87 Difference]: Start difference. First operand 8811 states and 13106 transitions. Second operand 3 states. [2019-09-08 05:00:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:43,738 INFO L93 Difference]: Finished difference Result 19661 states and 29838 transitions. [2019-09-08 05:00:43,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:43,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-09-08 05:00:43,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:43,781 INFO L225 Difference]: With dead ends: 19661 [2019-09-08 05:00:43,781 INFO L226 Difference]: Without dead ends: 11061 [2019-09-08 05:00:43,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11061 states. [2019-09-08 05:00:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11061 to 11059. [2019-09-08 05:00:44,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11059 states. [2019-09-08 05:00:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11059 states to 11059 states and 16920 transitions. [2019-09-08 05:00:44,336 INFO L78 Accepts]: Start accepts. Automaton has 11059 states and 16920 transitions. Word has length 213 [2019-09-08 05:00:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:44,337 INFO L475 AbstractCegarLoop]: Abstraction has 11059 states and 16920 transitions. [2019-09-08 05:00:44,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 11059 states and 16920 transitions. [2019-09-08 05:00:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-08 05:00:44,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:44,384 INFO L399 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, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:44,384 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:44,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:44,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1465951924, now seen corresponding path program 1 times [2019-09-08 05:00:44,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:44,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:44,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:44,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:44,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:44,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:44,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:44,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:44,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:44,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:44,515 INFO L87 Difference]: Start difference. First operand 11059 states and 16920 transitions. Second operand 3 states. [2019-09-08 05:00:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:45,070 INFO L93 Difference]: Finished difference Result 26445 states and 41352 transitions. [2019-09-08 05:00:45,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:45,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-09-08 05:00:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:45,108 INFO L225 Difference]: With dead ends: 26445 [2019-09-08 05:00:45,108 INFO L226 Difference]: Without dead ends: 15609 [2019-09-08 05:00:45,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15609 states. [2019-09-08 05:00:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15609 to 15607. [2019-09-08 05:00:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15607 states. [2019-09-08 05:00:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15607 states to 15607 states and 24570 transitions. [2019-09-08 05:00:45,717 INFO L78 Accepts]: Start accepts. Automaton has 15607 states and 24570 transitions. Word has length 214 [2019-09-08 05:00:45,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:45,718 INFO L475 AbstractCegarLoop]: Abstraction has 15607 states and 24570 transitions. [2019-09-08 05:00:45,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 15607 states and 24570 transitions. [2019-09-08 05:00:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 05:00:45,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:45,751 INFO L399 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:45,751 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:45,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:45,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1318112542, now seen corresponding path program 1 times [2019-09-08 05:00:45,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:45,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:45,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:45,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:45,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:45,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:45,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:45,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:45,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:45,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:45,875 INFO L87 Difference]: Start difference. First operand 15607 states and 24570 transitions. Second operand 3 states. [2019-09-08 05:00:46,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:46,993 INFO L93 Difference]: Finished difference Result 39433 states and 63260 transitions. [2019-09-08 05:00:46,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:46,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-09-08 05:00:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:47,048 INFO L225 Difference]: With dead ends: 39433 [2019-09-08 05:00:47,048 INFO L226 Difference]: Without dead ends: 24061 [2019-09-08 05:00:47,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24061 states. [2019-09-08 05:00:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24061 to 24059. [2019-09-08 05:00:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24059 states. [2019-09-08 05:00:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24059 states to 24059 states and 38716 transitions. [2019-09-08 05:00:49,164 INFO L78 Accepts]: Start accepts. Automaton has 24059 states and 38716 transitions. Word has length 215 [2019-09-08 05:00:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:49,164 INFO L475 AbstractCegarLoop]: Abstraction has 24059 states and 38716 transitions. [2019-09-08 05:00:49,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 24059 states and 38716 transitions. [2019-09-08 05:00:49,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 05:00:49,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:49,217 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2019-09-08 05:00:49,217 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:49,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:49,218 INFO L82 PathProgramCache]: Analyzing trace with hash -549044220, now seen corresponding path program 1 times [2019-09-08 05:00:49,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:49,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:49,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:49,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:49,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:00:49,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:00:49,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:00:49,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:49,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 2794 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:00:49,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:00:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:00:49,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:00:49,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 05:00:49,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:00:49,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:00:49,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:00:49,847 INFO L87 Difference]: Start difference. First operand 24059 states and 38716 transitions. Second operand 6 states. [2019-09-08 05:00:50,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:50,502 INFO L93 Difference]: Finished difference Result 30811 states and 48306 transitions. [2019-09-08 05:00:50,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:00:50,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 222 [2019-09-08 05:00:50,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:50,559 INFO L225 Difference]: With dead ends: 30811 [2019-09-08 05:00:50,559 INFO L226 Difference]: Without dead ends: 25347 [2019-09-08 05:00:50,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:00:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25347 states. [2019-09-08 05:00:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25347 to 25239. [2019-09-08 05:00:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25239 states. [2019-09-08 05:00:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25239 states to 25239 states and 40528 transitions. [2019-09-08 05:00:51,652 INFO L78 Accepts]: Start accepts. Automaton has 25239 states and 40528 transitions. Word has length 222 [2019-09-08 05:00:51,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:51,652 INFO L475 AbstractCegarLoop]: Abstraction has 25239 states and 40528 transitions. [2019-09-08 05:00:51,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:00:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 25239 states and 40528 transitions. [2019-09-08 05:00:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 05:00:51,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:51,710 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:51,711 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:51,711 INFO L82 PathProgramCache]: Analyzing trace with hash 276770514, now seen corresponding path program 1 times [2019-09-08 05:00:51,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:51,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:51,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:51,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:51,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:51,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:51,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:51,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:51,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:51,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:51,862 INFO L87 Difference]: Start difference. First operand 25239 states and 40528 transitions. Second operand 3 states. [2019-09-08 05:00:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:53,240 INFO L93 Difference]: Finished difference Result 65803 states and 107198 transitions. [2019-09-08 05:00:53,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:53,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-08 05:00:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:53,327 INFO L225 Difference]: With dead ends: 65803 [2019-09-08 05:00:53,327 INFO L226 Difference]: Without dead ends: 41507 [2019-09-08 05:00:53,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41507 states. [2019-09-08 05:00:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41507 to 41505. [2019-09-08 05:00:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41505 states. [2019-09-08 05:00:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41505 states to 41505 states and 67446 transitions. [2019-09-08 05:00:55,068 INFO L78 Accepts]: Start accepts. Automaton has 41505 states and 67446 transitions. Word has length 216 [2019-09-08 05:00:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:55,068 INFO L475 AbstractCegarLoop]: Abstraction has 41505 states and 67446 transitions. [2019-09-08 05:00:55,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 41505 states and 67446 transitions. [2019-09-08 05:00:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 05:00:55,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:55,150 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:55,150 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1625042626, now seen corresponding path program 1 times [2019-09-08 05:00:55,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:55,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:55,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:55,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:55,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:55,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:55,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:55,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:55,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:55,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:55,265 INFO L87 Difference]: Start difference. First operand 41505 states and 67446 transitions. Second operand 3 states. [2019-09-08 05:00:58,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:58,700 INFO L93 Difference]: Finished difference Result 112811 states and 184536 transitions. [2019-09-08 05:00:58,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:58,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-08 05:00:58,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:58,867 INFO L225 Difference]: With dead ends: 112811 [2019-09-08 05:00:58,867 INFO L226 Difference]: Without dead ends: 72459 [2019-09-08 05:00:58,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72459 states. [2019-09-08 05:01:01,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72459 to 72457. [2019-09-08 05:01:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72457 states. [2019-09-08 05:01:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72457 states to 72457 states and 117662 transitions. [2019-09-08 05:01:01,668 INFO L78 Accepts]: Start accepts. Automaton has 72457 states and 117662 transitions. Word has length 217 [2019-09-08 05:01:01,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:01:01,668 INFO L475 AbstractCegarLoop]: Abstraction has 72457 states and 117662 transitions. [2019-09-08 05:01:01,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:01:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 72457 states and 117662 transitions. [2019-09-08 05:01:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 05:01:01,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:01:01,817 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:01:01,817 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:01:01,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:01:01,818 INFO L82 PathProgramCache]: Analyzing trace with hash -580093262, now seen corresponding path program 1 times [2019-09-08 05:01:01,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:01:01,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:01:01,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:01,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:01:01,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:01:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:01:01,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:01:01,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:01:01,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:01:01,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:01:01,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:01:01,926 INFO L87 Difference]: Start difference. First operand 72457 states and 117662 transitions. Second operand 3 states. [2019-09-08 05:01:07,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:01:07,504 INFO L93 Difference]: Finished difference Result 201977 states and 329726 transitions. [2019-09-08 05:01:07,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:01:07,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-09-08 05:01:07,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:01:07,814 INFO L225 Difference]: With dead ends: 201977 [2019-09-08 05:01:07,814 INFO L226 Difference]: Without dead ends: 130977 [2019-09-08 05:01:07,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:01:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130977 states. [2019-09-08 05:01:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130977 to 130975. [2019-09-08 05:01:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130975 states. [2019-09-08 05:01:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130975 states to 130975 states and 212038 transitions. [2019-09-08 05:01:16,653 INFO L78 Accepts]: Start accepts. Automaton has 130975 states and 212038 transitions. Word has length 218 [2019-09-08 05:01:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:01:16,653 INFO L475 AbstractCegarLoop]: Abstraction has 130975 states and 212038 transitions. [2019-09-08 05:01:16,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:01:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 130975 states and 212038 transitions. [2019-09-08 05:01:16,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 05:01:16,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:01:16,912 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:01:16,913 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:01:16,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:01:16,913 INFO L82 PathProgramCache]: Analyzing trace with hash -610880162, now seen corresponding path program 1 times [2019-09-08 05:01:16,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:01:16,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:01:16,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:16,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:01:16,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:01:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:01:17,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:01:17,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:01:17,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:01:17,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:01:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:01:17,037 INFO L87 Difference]: Start difference. First operand 130975 states and 212038 transitions. Second operand 3 states. [2019-09-08 05:01:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:01:26,769 INFO L93 Difference]: Finished difference Result 247241 states and 398070 transitions. [2019-09-08 05:01:26,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:01:26,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-08 05:01:26,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:01:27,386 INFO L225 Difference]: With dead ends: 247241 [2019-09-08 05:01:27,387 INFO L226 Difference]: Without dead ends: 241777 [2019-09-08 05:01:27,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:01:27,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241777 states. [2019-09-08 05:01:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241777 to 241775. [2019-09-08 05:01:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241775 states. [2019-09-08 05:01:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241775 states to 241775 states and 386372 transitions. [2019-09-08 05:01:41,849 INFO L78 Accepts]: Start accepts. Automaton has 241775 states and 386372 transitions. Word has length 219 [2019-09-08 05:01:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:01:41,850 INFO L475 AbstractCegarLoop]: Abstraction has 241775 states and 386372 transitions. [2019-09-08 05:01:41,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:01:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 241775 states and 386372 transitions. [2019-09-08 05:01:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 05:01:42,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:01:42,281 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:01:42,282 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:01:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:01:42,282 INFO L82 PathProgramCache]: Analyzing trace with hash -671553902, now seen corresponding path program 1 times [2019-09-08 05:01:42,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:01:42,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:01:42,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:42,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:01:42,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:01:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:01:42,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:01:42,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 05:01:42,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 05:01:42,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 05:01:42,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:01:42,762 INFO L87 Difference]: Start difference. First operand 241775 states and 386372 transitions. Second operand 21 states. [2019-09-08 05:01:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:01:57,546 INFO L93 Difference]: Finished difference Result 253009 states and 402420 transitions. [2019-09-08 05:01:57,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 05:01:57,547 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 220 [2019-09-08 05:01:57,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:01:58,160 INFO L225 Difference]: With dead ends: 253009 [2019-09-08 05:01:58,160 INFO L226 Difference]: Without dead ends: 248789 [2019-09-08 05:01:58,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=1711, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 05:01:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248789 states. [2019-09-08 05:02:18,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248789 to 248365. [2019-09-08 05:02:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248365 states. [2019-09-08 05:02:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248365 states to 248365 states and 395751 transitions. [2019-09-08 05:02:18,711 INFO L78 Accepts]: Start accepts. Automaton has 248365 states and 395751 transitions. Word has length 220 [2019-09-08 05:02:18,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:02:18,711 INFO L475 AbstractCegarLoop]: Abstraction has 248365 states and 395751 transitions. [2019-09-08 05:02:18,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 05:02:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 248365 states and 395751 transitions. [2019-09-08 05:02:19,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 05:02:19,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:02:19,133 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:02:19,133 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:02:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:02:19,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2027825193, now seen corresponding path program 1 times [2019-09-08 05:02:19,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:02:19,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:02:19,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:02:19,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:02:19,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:02:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:02:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 05:02:19,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:02:19,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:02:19,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:02:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:02:20,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 2801 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 05:02:20,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:02:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 05:02:26,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:02:26,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 49 [2019-09-08 05:02:26,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 05:02:26,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 05:02:26,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2192, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 05:02:26,491 INFO L87 Difference]: Start difference. First operand 248365 states and 395751 transitions. Second operand 49 states. [2019-09-08 05:03:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:03:19,632 INFO L93 Difference]: Finished difference Result 517909 states and 842252 transitions. [2019-09-08 05:03:19,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 05:03:19,632 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 220 [2019-09-08 05:03:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:03:21,182 INFO L225 Difference]: With dead ends: 517909 [2019-09-08 05:03:21,182 INFO L226 Difference]: Without dead ends: 508489 [2019-09-08 05:03:21,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2216 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1005, Invalid=9501, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 05:03:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508489 states. [2019-09-08 05:04:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508489 to 507451. [2019-09-08 05:04:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507451 states. [2019-09-08 05:04:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507451 states to 507451 states and 827217 transitions. [2019-09-08 05:04:04,748 INFO L78 Accepts]: Start accepts. Automaton has 507451 states and 827217 transitions. Word has length 220 [2019-09-08 05:04:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:04:04,749 INFO L475 AbstractCegarLoop]: Abstraction has 507451 states and 827217 transitions. [2019-09-08 05:04:04,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 05:04:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 507451 states and 827217 transitions. [2019-09-08 05:04:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 05:04:14,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:04:14,204 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:04:14,204 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:04:14,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:04:14,205 INFO L82 PathProgramCache]: Analyzing trace with hash -21924838, now seen corresponding path program 1 times [2019-09-08 05:04:14,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:04:14,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:04:14,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:14,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:04:14,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:04:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:04:14,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:04:14,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:04:14,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:04:14,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:04:14,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:04:14,329 INFO L87 Difference]: Start difference. First operand 507451 states and 827217 transitions. Second operand 5 states. [2019-09-08 05:04:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:04:41,528 INFO L93 Difference]: Finished difference Result 523523 states and 849420 transitions. [2019-09-08 05:04:41,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:04:41,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 221 [2019-09-08 05:04:41,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:04:43,045 INFO L225 Difference]: With dead ends: 523523 [2019-09-08 05:04:43,045 INFO L226 Difference]: Without dead ends: 507025 [2019-09-08 05:04:43,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:04:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507025 states. [2019-09-08 05:05:31,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507025 to 507025. [2019-09-08 05:05:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507025 states. [2019-09-08 05:05:33,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507025 states to 507025 states and 826539 transitions. [2019-09-08 05:05:33,601 INFO L78 Accepts]: Start accepts. Automaton has 507025 states and 826539 transitions. Word has length 221 [2019-09-08 05:05:33,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:05:33,602 INFO L475 AbstractCegarLoop]: Abstraction has 507025 states and 826539 transitions. [2019-09-08 05:05:33,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:05:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 507025 states and 826539 transitions. [2019-09-08 05:05:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 05:05:34,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:05:34,487 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:05:34,487 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:05:34,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:05:34,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1583432394, now seen corresponding path program 1 times [2019-09-08 05:05:34,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:05:34,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:05:34,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:05:34,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:05:34,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:05:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:05:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 05:05:34,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:05:34,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:05:34,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:05:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:05:35,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 2802 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 05:05:35,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:05:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 05:05:36,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:05:36,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 49 [2019-09-08 05:05:36,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 05:05:36,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 05:05:36,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2192, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 05:05:36,930 INFO L87 Difference]: Start difference. First operand 507025 states and 826539 transitions. Second operand 49 states. [2019-09-08 05:07:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:18,455 INFO L93 Difference]: Finished difference Result 1040297 states and 1732062 transitions. [2019-09-08 05:07:18,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 05:07:18,455 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 221 [2019-09-08 05:07:18,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:22,473 INFO L225 Difference]: With dead ends: 1040297 [2019-09-08 05:07:22,473 INFO L226 Difference]: Without dead ends: 1018193 [2019-09-08 05:07:22,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2216 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1005, Invalid=9501, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 05:07:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018193 states. [2019-09-08 05:08:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018193 to 1016131. [2019-09-08 05:08:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016131 states.