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_spec9_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:56:56,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:56:56,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:56:56,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:56:56,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:56:56,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:56:56,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:56:56,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:56:56,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:56:56,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:56:56,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:56:56,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:56:56,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:56:56,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:56:56,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:56:56,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:56:56,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:56:56,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:56:56,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:56:56,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:56:56,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:56:56,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:56:56,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:56:56,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:56:56,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:56:56,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:56:56,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:56:56,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:56:56,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:56:56,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:56:56,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:56:56,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:56:56,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:56:56,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:56:56,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:56:56,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:56:56,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:56:56,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:56:56,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:56:56,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:56:56,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:56:56,433 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 05:56:56,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:56:56,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:56:56,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:56:56,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:56:56,449 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:56:56,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:56:56,450 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:56:56,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:56:56,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:56:56,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:56:56,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:56:56,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:56:56,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:56:56,451 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:56:56,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:56:56,452 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:56:56,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:56:56,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:56:56,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:56:56,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:56:56,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:56:56,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:56:56,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:56:56,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:56:56,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:56:56,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:56:56,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:56:56,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:56:56,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:56:56,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:56:56,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:56:56,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:56:56,509 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:56:56,510 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:56:56,510 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product30.cil.c [2019-09-08 05:56:56,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcde37ce0/4a536ee6f038451c8acd23ef1157a9f7/FLAGba33254e6 [2019-09-08 05:56:57,262 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:56:57,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product30.cil.c [2019-09-08 05:56:57,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcde37ce0/4a536ee6f038451c8acd23ef1157a9f7/FLAGba33254e6 [2019-09-08 05:56:57,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcde37ce0/4a536ee6f038451c8acd23ef1157a9f7 [2019-09-08 05:56:57,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:56:57,431 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:56:57,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:56:57,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:56:57,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:56:57,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:56:57" (1/1) ... [2019-09-08 05:56:57,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@753d2334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:57, skipping insertion in model container [2019-09-08 05:56:57,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:56:57" (1/1) ... [2019-09-08 05:56:57,449 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:56:57,534 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:56:58,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:56:58,332 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:56:58,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:56:58,560 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:56:58,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:58 WrapperNode [2019-09-08 05:56:58,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:56:58,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:56:58,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:56:58,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:56:58,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:58" (1/1) ... [2019-09-08 05:56:58,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:58" (1/1) ... [2019-09-08 05:56:58,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:58" (1/1) ... [2019-09-08 05:56:58,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:58" (1/1) ... [2019-09-08 05:56:58,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:58" (1/1) ... [2019-09-08 05:56:58,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:58" (1/1) ... [2019-09-08 05:56:58,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:58" (1/1) ... [2019-09-08 05:56:58,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:56:58,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:56:58,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:56:58,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:56:58,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:56:58,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:56:58,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:56:58,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:56:58,820 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:56:58,821 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:56:58,822 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:56:58,822 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:56:58,822 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:56:58,823 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:56:58,823 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:56:58,824 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:56:58,824 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:56:58,825 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:56:58,825 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:56:58,826 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:56:58,826 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:56:58,829 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:56:58,829 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:56:58,829 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:56:58,829 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:56:58,830 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:56:58,830 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:56:58,830 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:56:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:56:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:56:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:56:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:56:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:56:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:56:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:56:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:56:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:56:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:56:58,833 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:56:58,833 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:56:58,833 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:56:58,833 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:56:58,833 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:56:58,833 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:56:58,834 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:56:58,834 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:56:58,834 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:56:58,835 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:56:58,835 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:56:58,835 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-09-08 05:56:58,835 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-08 05:56:58,835 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:56:58,835 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:56:58,835 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:56:58,836 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:56:58,836 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:56:58,836 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:56:58,836 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:56:58,836 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:56:58,836 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:56:58,836 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:56:58,837 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:56:58,837 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:56:58,837 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:56:58,837 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:56:58,837 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:56:58,837 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:56:58,838 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:56:58,838 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:56:58,838 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:56:58,838 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:56:58,839 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:56:58,839 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:56:58,839 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:56:58,839 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:56:58,839 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:56:58,840 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:56:58,840 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:56:58,840 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:56:58,841 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:56:58,841 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:56:58,841 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:56:58,842 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:56:58,842 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:56:58,842 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:56:58,842 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:56:58,842 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:56:58,843 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:56:58,843 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:56:58,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:56:58,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-09-08 05:56:58,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-09-08 05:56:58,844 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:56:58,845 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:56:58,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:56:58,845 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:56:58,846 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:56:58,846 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:56:58,846 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:56:58,846 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:56:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:56:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:56:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:56:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:56:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:56:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:56:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:56:58,848 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:56:58,848 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:56:58,848 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:56:58,848 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:56:58,848 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:56:58,848 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:56:58,848 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:56:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:56:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:56:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:56:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:56:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:56:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:56:58,850 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:56:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:56:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:56:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:56:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:56:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:56:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:56:58,852 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:56:58,852 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:56:58,853 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:56:58,853 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:56:58,854 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:56:58,854 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:56:58,854 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:56:58,854 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:56:58,854 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:56:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:56:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:56:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:56:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:56:58,856 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:56:58,856 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:56:58,856 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:56:58,856 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:56:58,857 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:56:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:56:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:56:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:56:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:56:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:56:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:56:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:56:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:56:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:56:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:56:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:56:58,874 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:56:58,874 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:56:58,874 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:56:58,875 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:56:58,875 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:56:58,875 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:56:58,875 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:56:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:56:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:56:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:56:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:56:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:56:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:56:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:56:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:56:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:56:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:56:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:56:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:56:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:56:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:56:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:56:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:56:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:56:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:56:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:56:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:56:58,878 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:56:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:56:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:56:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:56:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:56:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:56:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:56:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:56:58,879 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:56:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:56:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-09-08 05:56:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:56:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:56:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:56:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:56:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:56:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-09-08 05:56:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:56:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:56:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:56:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:56:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:56:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-09-08 05:56:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-08 05:56:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:56:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:56:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:56:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:56:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:56:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:56:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:56:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:56:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:56:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:56:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:56:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:56:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:56:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:56:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:56:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:56:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:56:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:56:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:56:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:56:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:56:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:56:58,885 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:56:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:56:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:56:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:56:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:56:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:56:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:56:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:56:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:56:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:56:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:56:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:56:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:56:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:56:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:56:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:56:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:56:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:56:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:56:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:56:58,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:56:58,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:56:58,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:57:01,071 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:57:01,072 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:57:01,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:57:01 BoogieIcfgContainer [2019-09-08 05:57:01,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:57:01,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:57:01,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:57:01,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:57:01,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:56:57" (1/3) ... [2019-09-08 05:57:01,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5592f200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:57:01, skipping insertion in model container [2019-09-08 05:57:01,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:58" (2/3) ... [2019-09-08 05:57:01,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5592f200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:57:01, skipping insertion in model container [2019-09-08 05:57:01,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:57:01" (3/3) ... [2019-09-08 05:57:01,082 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product30.cil.c [2019-09-08 05:57:01,092 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:57:01,102 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:57:01,119 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:57:01,166 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:57:01,167 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:57:01,167 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:57:01,168 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:57:01,172 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:57:01,173 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:57:01,173 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:57:01,173 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:57:01,173 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:57:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states. [2019-09-08 05:57:01,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 05:57:01,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:01,248 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] [2019-09-08 05:57:01,254 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:01,262 INFO L82 PathProgramCache]: Analyzing trace with hash -702244773, now seen corresponding path program 1 times [2019-09-08 05:57:01,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:01,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:01,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:01,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:01,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:57:01,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:01,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:57:01,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:57:01,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:57:01,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:57:01,894 INFO L87 Difference]: Start difference. First operand 548 states. Second operand 2 states. [2019-09-08 05:57:02,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:02,012 INFO L93 Difference]: Finished difference Result 782 states and 1030 transitions. [2019-09-08 05:57:02,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:57:02,015 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-09-08 05:57:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:02,115 INFO L225 Difference]: With dead ends: 782 [2019-09-08 05:57:02,115 INFO L226 Difference]: Without dead ends: 497 [2019-09-08 05:57:02,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:57:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-08 05:57:02,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2019-09-08 05:57:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-09-08 05:57:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 659 transitions. [2019-09-08 05:57:02,243 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 659 transitions. Word has length 158 [2019-09-08 05:57:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:02,245 INFO L475 AbstractCegarLoop]: Abstraction has 497 states and 659 transitions. [2019-09-08 05:57:02,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:57:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 659 transitions. [2019-09-08 05:57:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 05:57:02,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:02,250 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] [2019-09-08 05:57:02,251 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:02,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:02,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2104582375, now seen corresponding path program 1 times [2019-09-08 05:57:02,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:02,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:02,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:02,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:57:02,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:02,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:02,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:02,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:02,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:02,452 INFO L87 Difference]: Start difference. First operand 497 states and 659 transitions. Second operand 3 states. [2019-09-08 05:57:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:02,504 INFO L93 Difference]: Finished difference Result 765 states and 998 transitions. [2019-09-08 05:57:02,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:02,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-08 05:57:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:02,509 INFO L225 Difference]: With dead ends: 765 [2019-09-08 05:57:02,509 INFO L226 Difference]: Without dead ends: 500 [2019-09-08 05:57:02,511 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:57:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-09-08 05:57:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 499. [2019-09-08 05:57:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-08 05:57:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 661 transitions. [2019-09-08 05:57:02,557 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 661 transitions. Word has length 159 [2019-09-08 05:57:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:02,558 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 661 transitions. [2019-09-08 05:57:02,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 661 transitions. [2019-09-08 05:57:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 05:57:02,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:02,566 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] [2019-09-08 05:57:02,569 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:02,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:02,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1792836169, now seen corresponding path program 1 times [2019-09-08 05:57:02,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:02,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:02,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:57:02,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:02,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:02,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:02,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:02,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:02,777 INFO L87 Difference]: Start difference. First operand 499 states and 661 transitions. Second operand 3 states. [2019-09-08 05:57:02,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:02,822 INFO L93 Difference]: Finished difference Result 974 states and 1320 transitions. [2019-09-08 05:57:02,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:02,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-08 05:57:02,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:02,830 INFO L225 Difference]: With dead ends: 974 [2019-09-08 05:57:02,830 INFO L226 Difference]: Without dead ends: 540 [2019-09-08 05:57:02,832 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:57:02,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-08 05:57:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 539. [2019-09-08 05:57:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-09-08 05:57:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 730 transitions. [2019-09-08 05:57:02,868 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 730 transitions. Word has length 169 [2019-09-08 05:57:02,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:02,870 INFO L475 AbstractCegarLoop]: Abstraction has 539 states and 730 transitions. [2019-09-08 05:57:02,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 730 transitions. [2019-09-08 05:57:02,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 05:57:02,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:02,879 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] [2019-09-08 05:57:02,879 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:02,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:02,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2122223245, now seen corresponding path program 1 times [2019-09-08 05:57:02,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:02,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:02,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:02,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:02,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:57:03,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:03,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:03,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:03,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:03,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:03,107 INFO L87 Difference]: Start difference. First operand 539 states and 730 transitions. Second operand 3 states. [2019-09-08 05:57:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:03,147 INFO L93 Difference]: Finished difference Result 1091 states and 1522 transitions. [2019-09-08 05:57:03,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:03,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-08 05:57:03,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:03,152 INFO L225 Difference]: With dead ends: 1091 [2019-09-08 05:57:03,152 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 05:57:03,154 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:57:03,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 05:57:03,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2019-09-08 05:57:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-08 05:57:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 862 transitions. [2019-09-08 05:57:03,177 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 862 transitions. Word has length 170 [2019-09-08 05:57:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:03,178 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 862 transitions. [2019-09-08 05:57:03,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 862 transitions. [2019-09-08 05:57:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 05:57:03,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:03,182 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] [2019-09-08 05:57:03,182 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:03,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1471474153, now seen corresponding path program 1 times [2019-09-08 05:57:03,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:03,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:03,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:03,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:03,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:57:03,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:03,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:03,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:03,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:03,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:03,337 INFO L87 Difference]: Start difference. First operand 616 states and 862 transitions. Second operand 3 states. [2019-09-08 05:57:03,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:03,379 INFO L93 Difference]: Finished difference Result 1316 states and 1908 transitions. [2019-09-08 05:57:03,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:03,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-08 05:57:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:03,385 INFO L225 Difference]: With dead ends: 1316 [2019-09-08 05:57:03,385 INFO L226 Difference]: Without dead ends: 765 [2019-09-08 05:57:03,387 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:57:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-09-08 05:57:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 764. [2019-09-08 05:57:03,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-09-08 05:57:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1114 transitions. [2019-09-08 05:57:03,430 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1114 transitions. Word has length 171 [2019-09-08 05:57:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:03,430 INFO L475 AbstractCegarLoop]: Abstraction has 764 states and 1114 transitions. [2019-09-08 05:57:03,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1114 transitions. [2019-09-08 05:57:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 05:57:03,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:03,435 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] [2019-09-08 05:57:03,435 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:03,436 INFO L82 PathProgramCache]: Analyzing trace with hash -388772307, now seen corresponding path program 1 times [2019-09-08 05:57:03,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:03,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:03,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:03,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:57:03,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:03,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:03,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:03,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:03,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:03,638 INFO L87 Difference]: Start difference. First operand 764 states and 1114 transitions. Second operand 3 states. [2019-09-08 05:57:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:03,708 INFO L93 Difference]: Finished difference Result 1748 states and 2644 transitions. [2019-09-08 05:57:03,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:03,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 05:57:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:03,721 INFO L225 Difference]: With dead ends: 1748 [2019-09-08 05:57:03,721 INFO L226 Difference]: Without dead ends: 1049 [2019-09-08 05:57:03,725 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:57:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-09-08 05:57:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1048. [2019-09-08 05:57:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-09-08 05:57:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1594 transitions. [2019-09-08 05:57:03,846 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1594 transitions. Word has length 172 [2019-09-08 05:57:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:03,848 INFO L475 AbstractCegarLoop]: Abstraction has 1048 states and 1594 transitions. [2019-09-08 05:57:03,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1594 transitions. [2019-09-08 05:57:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 05:57:03,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:03,857 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:57:03,857 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:03,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:03,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1194793961, now seen corresponding path program 1 times [2019-09-08 05:57:03,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:03,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:03,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:03,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:03,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:04,172 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:57:04,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:04,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:04,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:04,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:04,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:04,175 INFO L87 Difference]: Start difference. First operand 1048 states and 1594 transitions. Second operand 3 states. [2019-09-08 05:57:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:04,248 INFO L93 Difference]: Finished difference Result 1404 states and 2062 transitions. [2019-09-08 05:57:04,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:04,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 05:57:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:04,258 INFO L225 Difference]: With dead ends: 1404 [2019-09-08 05:57:04,258 INFO L226 Difference]: Without dead ends: 1141 [2019-09-08 05:57:04,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:57:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-09-08 05:57:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2019-09-08 05:57:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1141 states. [2019-09-08 05:57:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1717 transitions. [2019-09-08 05:57:04,347 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1717 transitions. Word has length 175 [2019-09-08 05:57:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:04,348 INFO L475 AbstractCegarLoop]: Abstraction has 1141 states and 1717 transitions. [2019-09-08 05:57:04,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1717 transitions. [2019-09-08 05:57:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 05:57:04,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:04,358 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:04,358 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:04,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:04,358 INFO L82 PathProgramCache]: Analyzing trace with hash 895322575, now seen corresponding path program 1 times [2019-09-08 05:57:04,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:04,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:04,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:04,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:04,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 05:57:05,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:57:05,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:57:05,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:05,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 3523 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:57:05,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:57:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 05:57:06,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:57:06,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-09-08 05:57:06,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 05:57:06,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 05:57:06,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:57:06,148 INFO L87 Difference]: Start difference. First operand 1141 states and 1717 transitions. Second operand 29 states. [2019-09-08 05:57:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:34,091 INFO L93 Difference]: Finished difference Result 4732 states and 7001 transitions. [2019-09-08 05:57:34,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-08 05:57:34,092 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 318 [2019-09-08 05:57:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:34,119 INFO L225 Difference]: With dead ends: 4732 [2019-09-08 05:57:34,120 INFO L226 Difference]: Without dead ends: 3621 [2019-09-08 05:57:34,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5969 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1453, Invalid=17453, Unknown=0, NotChecked=0, Total=18906 [2019-09-08 05:57:34,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2019-09-08 05:57:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 3271. [2019-09-08 05:57:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3271 states. [2019-09-08 05:57:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 4852 transitions. [2019-09-08 05:57:34,319 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 4852 transitions. Word has length 318 [2019-09-08 05:57:34,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:34,320 INFO L475 AbstractCegarLoop]: Abstraction has 3271 states and 4852 transitions. [2019-09-08 05:57:34,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 05:57:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 4852 transitions. [2019-09-08 05:57:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 05:57:34,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:34,340 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:34,340 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:34,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:34,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1608509808, now seen corresponding path program 1 times [2019-09-08 05:57:34,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:34,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:34,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:34,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:34,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:57:34,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:34,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:57:34,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:57:34,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:57:34,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:57:34,561 INFO L87 Difference]: Start difference. First operand 3271 states and 4852 transitions. Second operand 5 states. [2019-09-08 05:57:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:34,729 INFO L93 Difference]: Finished difference Result 4671 states and 6667 transitions. [2019-09-08 05:57:34,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:57:34,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 323 [2019-09-08 05:57:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:34,757 INFO L225 Difference]: With dead ends: 4671 [2019-09-08 05:57:34,758 INFO L226 Difference]: Without dead ends: 3192 [2019-09-08 05:57:34,766 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:57:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2019-09-08 05:57:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 3178. [2019-09-08 05:57:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-09-08 05:57:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4713 transitions. [2019-09-08 05:57:34,928 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4713 transitions. Word has length 323 [2019-09-08 05:57:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:34,931 INFO L475 AbstractCegarLoop]: Abstraction has 3178 states and 4713 transitions. [2019-09-08 05:57:34,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:57:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4713 transitions. [2019-09-08 05:57:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 05:57:34,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:34,952 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:34,953 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:34,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:34,953 INFO L82 PathProgramCache]: Analyzing trace with hash 879378300, now seen corresponding path program 1 times [2019-09-08 05:57:34,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:34,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:34,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:34,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:34,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 05:57:35,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:57:35,507 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) [2019-09-08 05:57:35,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:57:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:36,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 3525 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:57:36,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:57:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-08 05:57:36,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:57:36,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-09-08 05:57:36,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:57:36,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:57:36,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:57:36,268 INFO L87 Difference]: Start difference. First operand 3178 states and 4713 transitions. Second operand 23 states. [2019-09-08 05:57:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:58,425 INFO L93 Difference]: Finished difference Result 6844 states and 10113 transitions. [2019-09-08 05:57:58,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-08 05:57:58,427 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 320 [2019-09-08 05:57:58,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:58,456 INFO L225 Difference]: With dead ends: 6844 [2019-09-08 05:57:58,457 INFO L226 Difference]: Without dead ends: 3713 [2019-09-08 05:57:58,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4696 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1255, Invalid=13507, Unknown=0, NotChecked=0, Total=14762 [2019-09-08 05:57:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3713 states. [2019-09-08 05:57:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3713 to 3182. [2019-09-08 05:57:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3182 states. [2019-09-08 05:57:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4718 transitions. [2019-09-08 05:57:58,731 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4718 transitions. Word has length 320 [2019-09-08 05:57:58,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:58,732 INFO L475 AbstractCegarLoop]: Abstraction has 3182 states and 4718 transitions. [2019-09-08 05:57:58,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:57:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4718 transitions. [2019-09-08 05:57:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 05:57:58,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:58,756 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:58,756 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:58,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:58,756 INFO L82 PathProgramCache]: Analyzing trace with hash 378326922, now seen corresponding path program 1 times [2019-09-08 05:57:58,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:58,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:58,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:58,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:58,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-08 05:57:59,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:57:59,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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:57:59,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:59,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 3528 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:57:59,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:58:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:58:00,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:58:00,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2019-09-08 05:58:00,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:58:00,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:58:00,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:58:00,028 INFO L87 Difference]: Start difference. First operand 3182 states and 4718 transitions. Second operand 23 states. [2019-09-08 05:58:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:02,531 INFO L93 Difference]: Finished difference Result 6457 states and 9595 transitions. [2019-09-08 05:58:02,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 05:58:02,532 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 323 [2019-09-08 05:58:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:02,553 INFO L225 Difference]: With dead ends: 6457 [2019-09-08 05:58:02,554 INFO L226 Difference]: Without dead ends: 3221 [2019-09-08 05:58:02,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=1659, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 05:58:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2019-09-08 05:58:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3151. [2019-09-08 05:58:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3151 states. [2019-09-08 05:58:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3151 states to 3151 states and 4650 transitions. [2019-09-08 05:58:02,711 INFO L78 Accepts]: Start accepts. Automaton has 3151 states and 4650 transitions. Word has length 323 [2019-09-08 05:58:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:02,712 INFO L475 AbstractCegarLoop]: Abstraction has 3151 states and 4650 transitions. [2019-09-08 05:58:02,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:58:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3151 states and 4650 transitions. [2019-09-08 05:58:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 05:58:02,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:02,729 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:02,730 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:02,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:02,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1627433531, now seen corresponding path program 1 times [2019-09-08 05:58:02,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:02,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:02,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:02,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-08 05:58:02,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:58:02,975 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) [2019-09-08 05:58:02,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:58:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:03,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 3527 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:58:03,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:58:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:58:03,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:58:03,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-09-08 05:58:03,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:58:03,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:58:03,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:58:03,744 INFO L87 Difference]: Start difference. First operand 3151 states and 4650 transitions. Second operand 18 states. [2019-09-08 05:58:06,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:06,076 INFO L93 Difference]: Finished difference Result 6296 states and 9313 transitions. [2019-09-08 05:58:06,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:58:06,078 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 324 [2019-09-08 05:58:06,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:06,101 INFO L225 Difference]: With dead ends: 6296 [2019-09-08 05:58:06,101 INFO L226 Difference]: Without dead ends: 3182 [2019-09-08 05:58:06,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:58:06,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2019-09-08 05:58:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 3145. [2019-09-08 05:58:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2019-09-08 05:58:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 4629 transitions. [2019-09-08 05:58:06,257 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 4629 transitions. Word has length 324 [2019-09-08 05:58:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:06,257 INFO L475 AbstractCegarLoop]: Abstraction has 3145 states and 4629 transitions. [2019-09-08 05:58:06,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:58:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 4629 transitions. [2019-09-08 05:58:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 05:58:06,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:06,272 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:06,272 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:06,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:06,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1022030648, now seen corresponding path program 1 times [2019-09-08 05:58:06,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:06,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:06,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:06,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:06,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-08 05:58:06,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:58:06,493 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:58:06,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:07,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 3530 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:58:07,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:58:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:58:07,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:58:07,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-09-08 05:58:07,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:58:07,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:58:07,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:58:07,177 INFO L87 Difference]: Start difference. First operand 3145 states and 4629 transitions. Second operand 10 states. [2019-09-08 05:58:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:11,308 INFO L93 Difference]: Finished difference Result 8947 states and 13154 transitions. [2019-09-08 05:58:11,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:58:11,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 325 [2019-09-08 05:58:11,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:11,355 INFO L225 Difference]: With dead ends: 8947 [2019-09-08 05:58:11,355 INFO L226 Difference]: Without dead ends: 5878 [2019-09-08 05:58:11,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:58:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2019-09-08 05:58:11,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5552. [2019-09-08 05:58:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5552 states. [2019-09-08 05:58:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 8161 transitions. [2019-09-08 05:58:11,658 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 8161 transitions. Word has length 325 [2019-09-08 05:58:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:11,659 INFO L475 AbstractCegarLoop]: Abstraction has 5552 states and 8161 transitions. [2019-09-08 05:58:11,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:58:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 8161 transitions. [2019-09-08 05:58:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 05:58:11,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:11,689 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:11,689 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:11,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:11,689 INFO L82 PathProgramCache]: Analyzing trace with hash -847689486, now seen corresponding path program 1 times [2019-09-08 05:58:11,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:11,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:11,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:11,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-08 05:58:11,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:58:11,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:58:11,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:12,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 3528 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:58:12,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:58:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:58:13,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:58:13,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 05:58:13,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 05:58:13,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 05:58:13,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:58:13,113 INFO L87 Difference]: Start difference. First operand 5552 states and 8161 transitions. Second operand 14 states. [2019-09-08 05:58:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:21,681 INFO L93 Difference]: Finished difference Result 16974 states and 24643 transitions. [2019-09-08 05:58:21,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:58:21,681 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 324 [2019-09-08 05:58:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:21,735 INFO L225 Difference]: With dead ends: 16974 [2019-09-08 05:58:21,735 INFO L226 Difference]: Without dead ends: 11486 [2019-09-08 05:58:21,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:58:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11486 states. [2019-09-08 05:58:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11486 to 10702. [2019-09-08 05:58:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10702 states. [2019-09-08 05:58:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10702 states to 10702 states and 15402 transitions. [2019-09-08 05:58:22,186 INFO L78 Accepts]: Start accepts. Automaton has 10702 states and 15402 transitions. Word has length 324 [2019-09-08 05:58:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:22,187 INFO L475 AbstractCegarLoop]: Abstraction has 10702 states and 15402 transitions. [2019-09-08 05:58:22,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 05:58:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 10702 states and 15402 transitions. [2019-09-08 05:58:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 05:58:22,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:22,234 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:22,234 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:22,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:22,234 INFO L82 PathProgramCache]: Analyzing trace with hash 26976831, now seen corresponding path program 1 times [2019-09-08 05:58:22,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:22,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:22,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:22,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:22,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-08 05:58:22,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:58:22,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:58:22,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:23,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 3530 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:58:23,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:58:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-08 05:58:23,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:58:23,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 4] total 26 [2019-09-08 05:58:23,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 05:58:23,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 05:58:23,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-09-08 05:58:23,442 INFO L87 Difference]: Start difference. First operand 10702 states and 15402 transitions. Second operand 26 states. [2019-09-08 05:58:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:24,596 INFO L93 Difference]: Finished difference Result 19481 states and 28600 transitions. [2019-09-08 05:58:24,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 05:58:24,597 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 326 [2019-09-08 05:58:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:24,637 INFO L225 Difference]: With dead ends: 19481 [2019-09-08 05:58:24,637 INFO L226 Difference]: Without dead ends: 8925 [2019-09-08 05:58:24,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=1170, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 05:58:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8925 states. [2019-09-08 05:58:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8925 to 8863. [2019-09-08 05:58:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8863 states. [2019-09-08 05:58:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8863 states to 8863 states and 12826 transitions. [2019-09-08 05:58:25,111 INFO L78 Accepts]: Start accepts. Automaton has 8863 states and 12826 transitions. Word has length 326 [2019-09-08 05:58:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:25,111 INFO L475 AbstractCegarLoop]: Abstraction has 8863 states and 12826 transitions. [2019-09-08 05:58:25,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 05:58:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 8863 states and 12826 transitions. [2019-09-08 05:58:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-08 05:58:25,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:25,145 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:25,145 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1769467160, now seen corresponding path program 1 times [2019-09-08 05:58:25,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:25,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:25,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:25,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:25,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:58:25,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:25,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:25,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:25,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:25,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:25,456 INFO L87 Difference]: Start difference. First operand 8863 states and 12826 transitions. Second operand 3 states. [2019-09-08 05:58:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:25,705 INFO L93 Difference]: Finished difference Result 19235 states and 28428 transitions. [2019-09-08 05:58:25,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:25,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2019-09-08 05:58:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:25,748 INFO L225 Difference]: With dead ends: 19235 [2019-09-08 05:58:25,749 INFO L226 Difference]: Without dead ends: 10504 [2019-09-08 05:58:25,770 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:58:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10504 states. [2019-09-08 05:58:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10504 to 10501. [2019-09-08 05:58:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10501 states. [2019-09-08 05:58:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10501 states to 10501 states and 15711 transitions. [2019-09-08 05:58:26,290 INFO L78 Accepts]: Start accepts. Automaton has 10501 states and 15711 transitions. Word has length 340 [2019-09-08 05:58:26,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:26,290 INFO L475 AbstractCegarLoop]: Abstraction has 10501 states and 15711 transitions. [2019-09-08 05:58:26,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 10501 states and 15711 transitions. [2019-09-08 05:58:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 05:58:26,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:26,320 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:26,320 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:26,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:26,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1059412040, now seen corresponding path program 1 times [2019-09-08 05:58:26,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:26,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:26,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:26,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:26,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 05:58:26,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:26,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:26,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:26,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:26,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:26,520 INFO L87 Difference]: Start difference. First operand 10501 states and 15711 transitions. Second operand 3 states. [2019-09-08 05:58:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:26,954 INFO L93 Difference]: Finished difference Result 24179 states and 37161 transitions. [2019-09-08 05:58:26,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:26,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 373 [2019-09-08 05:58:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:27,002 INFO L225 Difference]: With dead ends: 24179 [2019-09-08 05:58:27,003 INFO L226 Difference]: Without dead ends: 13818 [2019-09-08 05:58:27,026 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:58:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13818 states. [2019-09-08 05:58:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13818 to 13815. [2019-09-08 05:58:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13815 states. [2019-09-08 05:58:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13815 states to 13815 states and 21520 transitions. [2019-09-08 05:58:27,822 INFO L78 Accepts]: Start accepts. Automaton has 13815 states and 21520 transitions. Word has length 373 [2019-09-08 05:58:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:27,822 INFO L475 AbstractCegarLoop]: Abstraction has 13815 states and 21520 transitions. [2019-09-08 05:58:27,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 13815 states and 21520 transitions. [2019-09-08 05:58:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-08 05:58:27,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:27,874 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:27,874 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:27,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:27,875 INFO L82 PathProgramCache]: Analyzing trace with hash -129905672, now seen corresponding path program 1 times [2019-09-08 05:58:27,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:27,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:27,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:27,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:27,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:58:28,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:28,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:28,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:28,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:28,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:28,103 INFO L87 Difference]: Start difference. First operand 13815 states and 21520 transitions. Second operand 3 states. [2019-09-08 05:58:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:28,756 INFO L93 Difference]: Finished difference Result 33633 states and 53811 transitions. [2019-09-08 05:58:28,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:28,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-09-08 05:58:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:28,829 INFO L225 Difference]: With dead ends: 33633 [2019-09-08 05:58:28,829 INFO L226 Difference]: Without dead ends: 19964 [2019-09-08 05:58:28,861 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:58:28,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19964 states. [2019-09-08 05:58:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19964 to 19961. [2019-09-08 05:58:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19961 states. [2019-09-08 05:58:29,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19961 states to 19961 states and 32273 transitions. [2019-09-08 05:58:29,918 INFO L78 Accepts]: Start accepts. Automaton has 19961 states and 32273 transitions. Word has length 342 [2019-09-08 05:58:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:29,919 INFO L475 AbstractCegarLoop]: Abstraction has 19961 states and 32273 transitions. [2019-09-08 05:58:29,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 19961 states and 32273 transitions. [2019-09-08 05:58:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 05:58:29,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:29,987 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:29,987 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:29,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:29,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1180041958, now seen corresponding path program 1 times [2019-09-08 05:58:29,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:29,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:29,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:29,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:29,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:58:30,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:30,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:30,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:30,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:30,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:30,181 INFO L87 Difference]: Start difference. First operand 19961 states and 32273 transitions. Second operand 3 states. [2019-09-08 05:58:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:31,406 INFO L93 Difference]: Finished difference Result 52257 states and 86256 transitions. [2019-09-08 05:58:31,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:31,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-09-08 05:58:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:31,539 INFO L225 Difference]: With dead ends: 52257 [2019-09-08 05:58:31,539 INFO L226 Difference]: Without dead ends: 32446 [2019-09-08 05:58:31,612 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:58:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32446 states. [2019-09-08 05:58:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32446 to 32443. [2019-09-08 05:58:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32443 states. [2019-09-08 05:58:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32443 states to 32443 states and 53778 transitions. [2019-09-08 05:58:33,430 INFO L78 Accepts]: Start accepts. Automaton has 32443 states and 53778 transitions. Word has length 333 [2019-09-08 05:58:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:33,430 INFO L475 AbstractCegarLoop]: Abstraction has 32443 states and 53778 transitions. [2019-09-08 05:58:33,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 32443 states and 53778 transitions. [2019-09-08 05:58:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-08 05:58:33,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:33,513 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:33,513 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:33,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1498722088, now seen corresponding path program 1 times [2019-09-08 05:58:33,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:33,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:33,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:33,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:33,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 05:58:33,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:33,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:33,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:33,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:33,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:33,700 INFO L87 Difference]: Start difference. First operand 32443 states and 53778 transitions. Second operand 3 states. [2019-09-08 05:58:36,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:36,432 INFO L93 Difference]: Finished difference Result 87777 states and 146922 transitions. [2019-09-08 05:58:36,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:36,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 374 [2019-09-08 05:58:36,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:36,620 INFO L225 Difference]: With dead ends: 87777 [2019-09-08 05:58:36,620 INFO L226 Difference]: Without dead ends: 55492 [2019-09-08 05:58:36,733 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:58:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55492 states. [2019-09-08 05:58:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55492 to 55489. [2019-09-08 05:58:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55489 states. [2019-09-08 05:58:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55489 states to 55489 states and 92567 transitions. [2019-09-08 05:58:39,533 INFO L78 Accepts]: Start accepts. Automaton has 55489 states and 92567 transitions. Word has length 374 [2019-09-08 05:58:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:39,534 INFO L475 AbstractCegarLoop]: Abstraction has 55489 states and 92567 transitions. [2019-09-08 05:58:39,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 55489 states and 92567 transitions. [2019-09-08 05:58:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-08 05:58:39,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:39,693 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:39,693 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash -499887364, now seen corresponding path program 1 times [2019-09-08 05:58:39,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:39,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:39,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:39,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:39,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:58:39,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:39,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:39,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:39,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:39,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:39,861 INFO L87 Difference]: Start difference. First operand 55489 states and 92567 transitions. Second operand 3 states. [2019-09-08 05:58:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:45,692 INFO L93 Difference]: Finished difference Result 154591 states and 260196 transitions. [2019-09-08 05:58:45,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:45,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2019-09-08 05:58:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:46,041 INFO L225 Difference]: With dead ends: 154591 [2019-09-08 05:58:46,042 INFO L226 Difference]: Without dead ends: 99270 [2019-09-08 05:58:46,143 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:58:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99270 states. [2019-09-08 05:58:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99270 to 99267. [2019-09-08 05:58:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99267 states. [2019-09-08 05:58:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99267 states to 99267 states and 166296 transitions. [2019-09-08 05:58:51,024 INFO L78 Accepts]: Start accepts. Automaton has 99267 states and 166296 transitions. Word has length 347 [2019-09-08 05:58:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:51,024 INFO L475 AbstractCegarLoop]: Abstraction has 99267 states and 166296 transitions. [2019-09-08 05:58:51,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 99267 states and 166296 transitions. [2019-09-08 05:58:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-08 05:58:51,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:51,454 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:51,454 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:51,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:51,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1266837652, now seen corresponding path program 1 times [2019-09-08 05:58:51,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:51,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:51,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:58:51,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:51,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:51,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:51,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:51,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:51,641 INFO L87 Difference]: Start difference. First operand 99267 states and 166296 transitions. Second operand 3 states. [2019-09-08 05:58:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:59,951 INFO L93 Difference]: Finished difference Result 188741 states and 313368 transitions. [2019-09-08 05:58:59,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:59,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-09-08 05:58:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:59:00,601 INFO L225 Difference]: With dead ends: 188741 [2019-09-08 05:59:00,601 INFO L226 Difference]: Without dead ends: 182202 [2019-09-08 05:59:00,664 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:59:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182202 states. [2019-09-08 05:59:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182202 to 182199. [2019-09-08 05:59:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182199 states. [2019-09-08 05:59:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182199 states to 182199 states and 301448 transitions. [2019-09-08 05:59:15,411 INFO L78 Accepts]: Start accepts. Automaton has 182199 states and 301448 transitions. Word has length 348 [2019-09-08 05:59:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:59:15,411 INFO L475 AbstractCegarLoop]: Abstraction has 182199 states and 301448 transitions. [2019-09-08 05:59:15,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:59:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 182199 states and 301448 transitions. [2019-09-08 05:59:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 05:59:16,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:59:16,110 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:16,110 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:59:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:59:16,110 INFO L82 PathProgramCache]: Analyzing trace with hash -791571848, now seen corresponding path program 1 times [2019-09-08 05:59:16,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:59:16,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:59:16,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:16,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:59:16,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:59:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:59:16,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:59:16,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:59:16,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:59:16,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:59:16,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:59:16,338 INFO L87 Difference]: Start difference. First operand 182199 states and 301448 transitions. Second operand 10 states. [2019-09-08 05:59:26,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:59:26,742 INFO L93 Difference]: Finished difference Result 184298 states and 304199 transitions. [2019-09-08 05:59:26,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:59:26,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 339 [2019-09-08 05:59:26,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:59:27,256 INFO L225 Difference]: With dead ends: 184298 [2019-09-08 05:59:27,256 INFO L226 Difference]: Without dead ends: 182199 [2019-09-08 05:59:27,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:59:27,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182199 states. [2019-09-08 05:59:36,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182199 to 182199. [2019-09-08 05:59:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182199 states. [2019-09-08 05:59:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182199 states to 182199 states and 301440 transitions. [2019-09-08 05:59:36,902 INFO L78 Accepts]: Start accepts. Automaton has 182199 states and 301440 transitions. Word has length 339 [2019-09-08 05:59:36,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:59:36,902 INFO L475 AbstractCegarLoop]: Abstraction has 182199 states and 301440 transitions. [2019-09-08 05:59:36,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:59:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 182199 states and 301440 transitions. [2019-09-08 05:59:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 05:59:37,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:59:37,598 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:37,599 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:59:37,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:59:37,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1469578755, now seen corresponding path program 1 times [2019-09-08 05:59:37,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:59:37,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:59:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:37,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:59:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:59:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-08 05:59:37,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:59:37,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:59:37,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:59:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:59:38,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 3710 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 05:59:38,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:59:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 05:59:38,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:59:38,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2019-09-08 05:59:38,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:59:38,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:59:38,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:59:38,523 INFO L87 Difference]: Start difference. First operand 182199 states and 301440 transitions. Second operand 12 states. [2019-09-08 06:00:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:00:16,739 INFO L93 Difference]: Finished difference Result 542329 states and 915929 transitions. [2019-09-08 06:00:16,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 06:00:16,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 372 [2019-09-08 06:00:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:00:18,716 INFO L225 Difference]: With dead ends: 542329 [2019-09-08 06:00:18,716 INFO L226 Difference]: Without dead ends: 535901 [2019-09-08 06:00:19,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-09-08 06:00:19,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535901 states. [2019-09-08 06:00:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535901 to 363829. [2019-09-08 06:00:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363829 states. [2019-09-08 06:00:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363829 states to 363829 states and 614097 transitions. [2019-09-08 06:00:58,572 INFO L78 Accepts]: Start accepts. Automaton has 363829 states and 614097 transitions. Word has length 372 [2019-09-08 06:00:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:00:58,573 INFO L475 AbstractCegarLoop]: Abstraction has 363829 states and 614097 transitions. [2019-09-08 06:00:58,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:00:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 363829 states and 614097 transitions. [2019-09-08 06:01:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-08 06:01:00,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:01:00,538 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:01:00,538 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:01:00,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:01:00,538 INFO L82 PathProgramCache]: Analyzing trace with hash 124774802, now seen corresponding path program 1 times [2019-09-08 06:01:00,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:01:00,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:01:00,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:01:00,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:01:00,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:01:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:01:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-08 06:01:00,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:01:00,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:01:00,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:01:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:01:01,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 3713 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:01:01,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:01:02,998 WARN L188 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 3 [2019-09-08 06:01:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:01:03,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:01:03,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 06:01:03,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 06:01:03,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 06:01:03,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:01:03,130 INFO L87 Difference]: Start difference. First operand 363829 states and 614097 transitions. Second operand 12 states. [2019-09-08 06:01:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:01:27,509 INFO L93 Difference]: Finished difference Result 542177 states and 915442 transitions. [2019-09-08 06:01:27,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 06:01:27,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 374 [2019-09-08 06:01:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:01:28,730 INFO L225 Difference]: With dead ends: 542177 [2019-09-08 06:01:28,730 INFO L226 Difference]: Without dead ends: 360265 [2019-09-08 06:01:29,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-09-08 06:01:29,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360265 states. [2019-09-08 06:02:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360265 to 360243. [2019-09-08 06:02:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360243 states. [2019-09-08 06:02:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360243 states to 360243 states and 608360 transitions. [2019-09-08 06:02:09,620 INFO L78 Accepts]: Start accepts. Automaton has 360243 states and 608360 transitions. Word has length 374 [2019-09-08 06:02:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:02:09,621 INFO L475 AbstractCegarLoop]: Abstraction has 360243 states and 608360 transitions. [2019-09-08 06:02:09,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:02:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 360243 states and 608360 transitions. [2019-09-08 06:02:12,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-09-08 06:02:12,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:02:12,786 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:12,786 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:02:12,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:02:12,786 INFO L82 PathProgramCache]: Analyzing trace with hash 261146953, now seen corresponding path program 1 times [2019-09-08 06:02:12,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:02:12,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:02:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:02:12,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:02:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:02:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:02:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 06:02:13,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:02:13,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:02:13,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:02:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:02:13,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 3714 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:02:13,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:02:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 06:02:14,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:02:14,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-09-08 06:02:14,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 06:02:14,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 06:02:14,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:02:14,037 INFO L87 Difference]: Start difference. First operand 360243 states and 608360 transitions. Second operand 20 states. [2019-09-08 06:02:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:02:39,313 INFO L93 Difference]: Finished difference Result 366566 states and 616529 transitions. [2019-09-08 06:02:39,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 06:02:39,314 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 375 [2019-09-08 06:02:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:02:40,476 INFO L225 Difference]: With dead ends: 366566 [2019-09-08 06:02:40,476 INFO L226 Difference]: Without dead ends: 360951 [2019-09-08 06:02:40,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2019-09-08 06:02:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360951 states. [2019-09-08 06:03:22,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360951 to 360219. [2019-09-08 06:03:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360219 states. [2019-09-08 06:03:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360219 states to 360219 states and 608315 transitions. [2019-09-08 06:03:23,642 INFO L78 Accepts]: Start accepts. Automaton has 360219 states and 608315 transitions. Word has length 375 [2019-09-08 06:03:23,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:03:23,642 INFO L475 AbstractCegarLoop]: Abstraction has 360219 states and 608315 transitions. [2019-09-08 06:03:23,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 06:03:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 360219 states and 608315 transitions. [2019-09-08 06:03:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-08 06:03:26,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:03:26,080 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:03:26,080 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:03:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:03:26,080 INFO L82 PathProgramCache]: Analyzing trace with hash 179757130, now seen corresponding path program 1 times [2019-09-08 06:03:26,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:03:26,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:03:26,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:03:26,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:03:26,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:03:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:03:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-08 06:03:26,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:03:26,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:03:26,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:03:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:03:26,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 3646 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 06:03:26,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:03:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 83 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 06:03:27,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:03:27,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18] total 23 [2019-09-08 06:03:27,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 06:03:27,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 06:03:27,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-09-08 06:03:27,453 INFO L87 Difference]: Start difference. First operand 360219 states and 608315 transitions. Second operand 23 states. [2019-09-08 06:04:30,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:04:30,828 INFO L93 Difference]: Finished difference Result 729502 states and 1288691 transitions. [2019-09-08 06:04:30,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 06:04:30,828 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 354 [2019-09-08 06:04:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:04:33,509 INFO L225 Difference]: With dead ends: 729502 [2019-09-08 06:04:33,510 INFO L226 Difference]: Without dead ends: 716359 [2019-09-08 06:04:33,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2044 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=688, Invalid=6794, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 06:04:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716359 states. [2019-09-08 06:05:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716359 to 712981. [2019-09-08 06:05:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712981 states. [2019-09-08 06:06:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712981 states to 712981 states and 1267132 transitions. [2019-09-08 06:06:02,091 INFO L78 Accepts]: Start accepts. Automaton has 712981 states and 1267132 transitions. Word has length 354 [2019-09-08 06:06:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:06:02,092 INFO L475 AbstractCegarLoop]: Abstraction has 712981 states and 1267132 transitions. [2019-09-08 06:06:02,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 06:06:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 712981 states and 1267132 transitions. [2019-09-08 06:06:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-08 06:06:08,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:06:08,425 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:06:08,425 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:06:08,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:06:08,426 INFO L82 PathProgramCache]: Analyzing trace with hash 533536642, now seen corresponding path program 1 times [2019-09-08 06:06:08,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:06:08,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:06:08,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:06:08,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:06:08,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:06:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:06:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-08 06:06:08,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:06:08,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:06:08,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:06:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:06:09,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 3637 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 06:06:09,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:06:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 06:06:09,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:06:09,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [9] total 26 [2019-09-08 06:06:09,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 06:06:09,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 06:06:09,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-08 06:06:09,605 INFO L87 Difference]: Start difference. First operand 712981 states and 1267132 transitions. Second operand 26 states. [2019-09-08 06:07:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:07:16,122 INFO L93 Difference]: Finished difference Result 738714 states and 1301007 transitions. [2019-09-08 06:07:16,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 06:07:16,123 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 355 [2019-09-08 06:07:16,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:07:18,573 INFO L225 Difference]: With dead ends: 738714 [2019-09-08 06:07:18,574 INFO L226 Difference]: Without dead ends: 723833 [2019-09-08 06:07:18,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1964 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=605, Invalid=7405, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 06:07:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723833 states.