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_spec27_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:54:21,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:54:21,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:54:21,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:54:21,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:54:21,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:54:21,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:54:21,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:54:21,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:54:21,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:54:21,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:54:21,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:54:21,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:54:21,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:54:21,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:54:21,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:54:21,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:54:21,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:54:21,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:54:21,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:54:21,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:54:21,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:54:21,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:54:21,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:54:21,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:54:21,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:54:21,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:54:21,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:54:21,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:54:21,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:54:21,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:54:21,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:54:21,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:54:21,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:54:21,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:54:21,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:54:21,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:54:21,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:54:21,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:54:21,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:54:21,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:54:21,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:54:21,505 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:54:21,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:54:21,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:54:21,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:54:21,507 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:54:21,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:54:21,507 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:54:21,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:54:21,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:54:21,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:54:21,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:54:21,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:54:21,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:54:21,509 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:54:21,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:54:21,509 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:54:21,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:54:21,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:54:21,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:54:21,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:54:21,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:54:21,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:54:21,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:54:21,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:54:21,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:54:21,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:54:21,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:54:21,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:54:21,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:54:21,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:54:21,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:54:21,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:54:21,582 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:54:21,582 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:54:21,583 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec27_product29.cil.c [2019-09-08 04:54:21,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e510aada0/1c6fb387783040da87034a0fb0e67c65/FLAGc4e0c868c [2019-09-08 04:54:22,239 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:54:22,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec27_product29.cil.c [2019-09-08 04:54:22,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e510aada0/1c6fb387783040da87034a0fb0e67c65/FLAGc4e0c868c [2019-09-08 04:54:22,446 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e510aada0/1c6fb387783040da87034a0fb0e67c65 [2019-09-08 04:54:22,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:54:22,458 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:54:22,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:54:22,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:54:22,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:54:22,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:54:22" (1/1) ... [2019-09-08 04:54:22,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab4ac59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:54:22, skipping insertion in model container [2019-09-08 04:54:22,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:54:22" (1/1) ... [2019-09-08 04:54:22,474 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:54:22,555 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:54:23,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:54:23,288 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:54:23,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:54:23,482 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:54:23,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:54:23 WrapperNode [2019-09-08 04:54:23,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:54:23,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:54:23,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:54:23,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:54:23,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:54:23" (1/1) ... [2019-09-08 04:54:23,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:54:23" (1/1) ... [2019-09-08 04:54:23,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:54:23" (1/1) ... [2019-09-08 04:54:23,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:54:23" (1/1) ... [2019-09-08 04:54:23,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:54:23" (1/1) ... [2019-09-08 04:54:23,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:54:23" (1/1) ... [2019-09-08 04:54:23,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:54:23" (1/1) ... [2019-09-08 04:54:23,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:54:23,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:54:23,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:54:23,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:54:23,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:54:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:54:23,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:54:23,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:54:23,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:54:23,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:54:23,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:54:23,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:54:23,726 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:54:23,726 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:54:23,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:54:23,727 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:54:23,727 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:54:23,727 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:54:23,728 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:54:23,728 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:54:23,729 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:54:23,729 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:54:23,730 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:54:23,730 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:54:23,730 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:54:23,731 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:54:23,731 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:54:23,731 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:54:23,731 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:54:23,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:54:23,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:54:23,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:54:23,733 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:54:23,733 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:54:23,733 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:54:23,733 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:54:23,733 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:54:23,733 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:54:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:54:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:54:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:54:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:54:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:54:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:54:23,735 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:54:23,735 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:54:23,735 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:54:23,736 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:54:23,736 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:54:23,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:54:23,736 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:54:23,737 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 04:54:23,737 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-08 04:54:23,737 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:54:23,737 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:54:23,737 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:54:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:54:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:54:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:54:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:54:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:54:23,739 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-08 04:54:23,739 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 04:54:23,739 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:54:23,739 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:54:23,739 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 04:54:23,740 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 04:54:23,740 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:54:23,740 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:54:23,740 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:54:23,740 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:54:23,741 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:54:23,741 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:54:23,741 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:54:23,742 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:54:23,742 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:54:23,742 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 04:54:23,742 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 04:54:23,742 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 04:54:23,742 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:54:23,743 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:54:23,743 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:54:23,743 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:54:23,743 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:54:23,744 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:54:23,744 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:54:23,744 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:54:23,744 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:54:23,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:54:23,745 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:54:23,745 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:54:23,745 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:54:23,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:54:23,747 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:54:23,747 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:54:23,748 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:54:23,748 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:54:23,748 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:54:23,749 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:54:23,749 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:54:23,749 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:54:23,749 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:54:23,750 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:54:23,750 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:54:23,750 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:54:23,750 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:54:23,750 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:54:23,751 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:54:23,751 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:54:23,751 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:54:23,751 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:54:23,751 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:54:23,752 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:54:23,752 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:54:23,752 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:54:23,752 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:54:23,752 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:54:23,753 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:54:23,753 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:54:23,753 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 04:54:23,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__VerifyForward_spec__1 [2019-09-08 04:54:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:54:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:54:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:54:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:54:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:54:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:54:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:54:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:54:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:54:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:54:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:54:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:54:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:54:23,758 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:54:23,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:54:23,758 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:54:23,759 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:54:23,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:54:23,759 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:54:23,759 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:54:23,759 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:54:23,760 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:54:23,760 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:54:23,760 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:54:23,761 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:54:23,765 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:54:23,766 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:54:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:54:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:54:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:54:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:54:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:54:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:54:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:54:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:54:23,773 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:54:23,773 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:54:23,773 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:54:23,773 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:54:23,773 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:54:23,773 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:54:23,773 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:54:23,773 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:54:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:54:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:54:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:54:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:54:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:54:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:54:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:54:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:54:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:54:23,776 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:54:23,776 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:54:23,776 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:54:23,776 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:54:23,776 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:54:23,776 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:54:23,776 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:54:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:54:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:54:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:54:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:54:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:54:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:54:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:54:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:54:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:54:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:54:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:54:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 04:54:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-08 04:54:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:54:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:54:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:54:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:54:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:54:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:54:23,780 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 04:54:23,780 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:54:23,780 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:54:23,780 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:54:23,780 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:54:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:54:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:54:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:54:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:54:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:54:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:54:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:54:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:54:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:54:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:54:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:54:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:54:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:54:23,783 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:54:23,783 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:54:23,783 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:54:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:54:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:54:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 04:54:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 04:54:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 04:54:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:54:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-08 04:54:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 04:54:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__VerifyForward_spec__1 [2019-09-08 04:54:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 04:54:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 04:54:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:54:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:54:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:54:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:54:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:54:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:54:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:54:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:54:23,787 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:54:23,787 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:54:23,787 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:54:23,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:54:23,787 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:54:23,787 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:54:23,788 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:54:23,788 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:54:23,788 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:54:23,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:54:23,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:54:23,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:54:25,841 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:54:25,841 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:54:25,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:54:25 BoogieIcfgContainer [2019-09-08 04:54:25,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:54:25,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:54:25,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:54:25,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:54:25,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:54:22" (1/3) ... [2019-09-08 04:54:25,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335b7e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:54:25, skipping insertion in model container [2019-09-08 04:54:25,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:54:23" (2/3) ... [2019-09-08 04:54:25,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335b7e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:54:25, skipping insertion in model container [2019-09-08 04:54:25,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:54:25" (3/3) ... [2019-09-08 04:54:25,852 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec27_product29.cil.c [2019-09-08 04:54:25,862 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:54:25,876 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:54:25,893 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:54:25,950 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:54:25,950 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:54:25,951 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:54:25,951 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:54:25,951 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:54:25,952 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:54:25,955 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:54:25,956 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:54:25,956 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:54:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2019-09-08 04:54:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 04:54:26,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:54:26,036 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 04:54:26,041 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:54:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:54:26,047 INFO L82 PathProgramCache]: Analyzing trace with hash -646444410, now seen corresponding path program 1 times [2019-09-08 04:54:26,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:54:26,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:54:26,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:26,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:26,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 04:54:26,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:54:26,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:54:26,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:54:26,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:54:26,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:54:26,826 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 2 states. [2019-09-08 04:54:26,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:54:26,904 INFO L93 Difference]: Finished difference Result 859 states and 1175 transitions. [2019-09-08 04:54:26,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:54:26,905 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 218 [2019-09-08 04:54:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:54:26,933 INFO L225 Difference]: With dead ends: 859 [2019-09-08 04:54:26,933 INFO L226 Difference]: Without dead ends: 552 [2019-09-08 04:54:26,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:54:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-08 04:54:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2019-09-08 04:54:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-08 04:54:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 757 transitions. [2019-09-08 04:54:27,104 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 757 transitions. Word has length 218 [2019-09-08 04:54:27,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:54:27,108 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 757 transitions. [2019-09-08 04:54:27,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:54:27,109 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 757 transitions. [2019-09-08 04:54:27,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 04:54:27,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:54:27,119 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 04:54:27,119 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:54:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:54:27,121 INFO L82 PathProgramCache]: Analyzing trace with hash -884240524, now seen corresponding path program 1 times [2019-09-08 04:54:27,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:54:27,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:54:27,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:27,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:27,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 04:54:27,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:54:27,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:54:27,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:54:27,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:54:27,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:54:27,433 INFO L87 Difference]: Start difference. First operand 552 states and 757 transitions. Second operand 3 states. [2019-09-08 04:54:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:54:27,488 INFO L93 Difference]: Finished difference Result 842 states and 1136 transitions. [2019-09-08 04:54:27,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:54:27,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-08 04:54:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:54:27,498 INFO L225 Difference]: With dead ends: 842 [2019-09-08 04:54:27,499 INFO L226 Difference]: Without dead ends: 555 [2019-09-08 04:54:27,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:54:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-08 04:54:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 554. [2019-09-08 04:54:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-08 04:54:27,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 759 transitions. [2019-09-08 04:54:27,531 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 759 transitions. Word has length 219 [2019-09-08 04:54:27,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:54:27,532 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 759 transitions. [2019-09-08 04:54:27,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:54:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 759 transitions. [2019-09-08 04:54:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 04:54:27,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:54:27,538 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 04:54:27,538 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:54:27,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:54:27,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1184170792, now seen corresponding path program 1 times [2019-09-08 04:54:27,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:54:27,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:54:27,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:27,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:27,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 04:54:27,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:54:27,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:54:27,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:54:27,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:54:27,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:54:27,733 INFO L87 Difference]: Start difference. First operand 554 states and 759 transitions. Second operand 3 states. [2019-09-08 04:54:27,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:54:27,765 INFO L93 Difference]: Finished difference Result 1084 states and 1516 transitions. [2019-09-08 04:54:27,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:54:27,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-08 04:54:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:54:27,771 INFO L225 Difference]: With dead ends: 1084 [2019-09-08 04:54:27,772 INFO L226 Difference]: Without dead ends: 595 [2019-09-08 04:54:27,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:54:27,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-08 04:54:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 594. [2019-09-08 04:54:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-09-08 04:54:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 828 transitions. [2019-09-08 04:54:27,811 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 828 transitions. Word has length 225 [2019-09-08 04:54:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:54:27,813 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 828 transitions. [2019-09-08 04:54:27,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:54:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 828 transitions. [2019-09-08 04:54:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 04:54:27,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:54:27,819 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 04:54:27,819 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:54:27,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:54:27,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1208160604, now seen corresponding path program 1 times [2019-09-08 04:54:27,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:54:27,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:54:27,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:27,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:27,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 04:54:28,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:54:28,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:54:28,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:29,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 2941 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:54:29,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:54:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 04:54:29,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:54:29,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-09-08 04:54:29,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 04:54:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 04:54:29,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-09-08 04:54:29,583 INFO L87 Difference]: Start difference. First operand 594 states and 828 transitions. Second operand 26 states. [2019-09-08 04:54:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:54:37,909 INFO L93 Difference]: Finished difference Result 2337 states and 3315 transitions. [2019-09-08 04:54:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 04:54:37,910 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 226 [2019-09-08 04:54:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:54:37,923 INFO L225 Difference]: With dead ends: 2337 [2019-09-08 04:54:37,923 INFO L226 Difference]: Without dead ends: 1779 [2019-09-08 04:54:37,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=496, Invalid=4616, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 04:54:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-09-08 04:54:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1747. [2019-09-08 04:54:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2019-09-08 04:54:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2453 transitions. [2019-09-08 04:54:38,044 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2453 transitions. Word has length 226 [2019-09-08 04:54:38,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:54:38,045 INFO L475 AbstractCegarLoop]: Abstraction has 1747 states and 2453 transitions. [2019-09-08 04:54:38,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 04:54:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2453 transitions. [2019-09-08 04:54:38,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 04:54:38,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:54:38,054 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-09-08 04:54:38,055 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:54:38,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:54:38,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1122337966, now seen corresponding path program 1 times [2019-09-08 04:54:38,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:54:38,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:54:38,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:38,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:38,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 04:54:38,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:54:38,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 04:54:38,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:54:38,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:54:38,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:54:38,428 INFO L87 Difference]: Start difference. First operand 1747 states and 2453 transitions. Second operand 18 states. [2019-09-08 04:54:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:54:38,910 INFO L93 Difference]: Finished difference Result 3089 states and 4328 transitions. [2019-09-08 04:54:38,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 04:54:38,910 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 228 [2019-09-08 04:54:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:54:38,922 INFO L225 Difference]: With dead ends: 3089 [2019-09-08 04:54:38,923 INFO L226 Difference]: Without dead ends: 1925 [2019-09-08 04:54:38,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:54:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-09-08 04:54:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2019-09-08 04:54:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2019-09-08 04:54:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2709 transitions. [2019-09-08 04:54:39,051 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2709 transitions. Word has length 228 [2019-09-08 04:54:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:54:39,052 INFO L475 AbstractCegarLoop]: Abstraction has 1925 states and 2709 transitions. [2019-09-08 04:54:39,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:54:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2709 transitions. [2019-09-08 04:54:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 04:54:39,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:54:39,062 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-09-08 04:54:39,062 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:54:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:54:39,062 INFO L82 PathProgramCache]: Analyzing trace with hash 2014178291, now seen corresponding path program 1 times [2019-09-08 04:54:39,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:54:39,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:54:39,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:39,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:39,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 04:54:39,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:54:39,428 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 04:54:39,442 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 04:54:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:39,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 2943 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:54:39,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:54:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 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 04:54:40,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:54:40,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-09-08 04:54:40,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 04:54:40,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 04:54:40,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-09-08 04:54:40,018 INFO L87 Difference]: Start difference. First operand 1925 states and 2709 transitions. Second operand 20 states. [2019-09-08 04:54:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:54:46,085 INFO L93 Difference]: Finished difference Result 3897 states and 5569 transitions. [2019-09-08 04:54:46,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 04:54:46,086 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 228 [2019-09-08 04:54:46,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:54:46,098 INFO L225 Difference]: With dead ends: 3897 [2019-09-08 04:54:46,099 INFO L226 Difference]: Without dead ends: 2023 [2019-09-08 04:54:46,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=423, Invalid=3483, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 04:54:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2019-09-08 04:54:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1988. [2019-09-08 04:54:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1988 states. [2019-09-08 04:54:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 2811 transitions. [2019-09-08 04:54:46,202 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 2811 transitions. Word has length 228 [2019-09-08 04:54:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:54:46,203 INFO L475 AbstractCegarLoop]: Abstraction has 1988 states and 2811 transitions. [2019-09-08 04:54:46,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 04:54:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2811 transitions. [2019-09-08 04:54:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 04:54:46,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:54:46,211 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:54:46,212 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:54:46,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:54:46,212 INFO L82 PathProgramCache]: Analyzing trace with hash 854386938, now seen corresponding path program 1 times [2019-09-08 04:54:46,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:54:46,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:54:46,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:46,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:46,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 04:54:46,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:54:46,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:54:46,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:54:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:46,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 2944 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:54:46,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:54:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 04:54:46,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:54:46,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 04:54:46,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:54:46,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:54:46,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:54:46,960 INFO L87 Difference]: Start difference. First operand 1988 states and 2811 transitions. Second operand 12 states. [2019-09-08 04:54:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:54:50,975 INFO L93 Difference]: Finished difference Result 6235 states and 8962 transitions. [2019-09-08 04:54:50,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:54:50,976 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 229 [2019-09-08 04:54:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:54:51,003 INFO L225 Difference]: With dead ends: 6235 [2019-09-08 04:54:51,004 INFO L226 Difference]: Without dead ends: 4308 [2019-09-08 04:54:51,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-09-08 04:54:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4308 states. [2019-09-08 04:54:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4308 to 4290. [2019-09-08 04:54:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4290 states. [2019-09-08 04:54:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4290 states to 4290 states and 6128 transitions. [2019-09-08 04:54:51,321 INFO L78 Accepts]: Start accepts. Automaton has 4290 states and 6128 transitions. Word has length 229 [2019-09-08 04:54:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:54:51,322 INFO L475 AbstractCegarLoop]: Abstraction has 4290 states and 6128 transitions. [2019-09-08 04:54:51,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:54:51,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4290 states and 6128 transitions. [2019-09-08 04:54:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 04:54:51,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:54:51,338 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:54:51,339 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:54:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:54:51,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1133576832, now seen corresponding path program 1 times [2019-09-08 04:54:51,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:54:51,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:54:51,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:51,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:51,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 04:54:51,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:54:51,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:54:51,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:54:51,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:54:51,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:54:51,632 INFO L87 Difference]: Start difference. First operand 4290 states and 6128 transitions. Second operand 7 states. [2019-09-08 04:54:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:54:53,663 INFO L93 Difference]: Finished difference Result 14407 states and 21716 transitions. [2019-09-08 04:54:53,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:54:53,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 230 [2019-09-08 04:54:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:54:53,745 INFO L225 Difference]: With dead ends: 14407 [2019-09-08 04:54:53,745 INFO L226 Difference]: Without dead ends: 11088 [2019-09-08 04:54:53,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:54:53,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11088 states. [2019-09-08 04:54:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11088 to 11082. [2019-09-08 04:54:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11082 states. [2019-09-08 04:54:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11082 states to 11082 states and 16668 transitions. [2019-09-08 04:54:54,480 INFO L78 Accepts]: Start accepts. Automaton has 11082 states and 16668 transitions. Word has length 230 [2019-09-08 04:54:54,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:54:54,483 INFO L475 AbstractCegarLoop]: Abstraction has 11082 states and 16668 transitions. [2019-09-08 04:54:54,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:54:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 11082 states and 16668 transitions. [2019-09-08 04:54:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 04:54:54,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:54:54,498 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:54:54,498 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:54:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:54:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2128744237, now seen corresponding path program 1 times [2019-09-08 04:54:54,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:54:54,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:54:54,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:54,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:54,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 04:54:55,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:54:55,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 04:54:55,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 04:54:55,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 04:54:55,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-09-08 04:54:55,012 INFO L87 Difference]: Start difference. First operand 11082 states and 16668 transitions. Second operand 26 states. [2019-09-08 04:54:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:54:55,980 INFO L93 Difference]: Finished difference Result 21403 states and 32782 transitions. [2019-09-08 04:54:55,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:54:55,980 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 231 [2019-09-08 04:54:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:54:56,053 INFO L225 Difference]: With dead ends: 21403 [2019-09-08 04:54:56,053 INFO L226 Difference]: Without dead ends: 11292 [2019-09-08 04:54:56,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 04:54:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11292 states. [2019-09-08 04:54:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11292 to 11272. [2019-09-08 04:54:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11272 states. [2019-09-08 04:54:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11272 states to 11272 states and 16976 transitions. [2019-09-08 04:54:57,333 INFO L78 Accepts]: Start accepts. Automaton has 11272 states and 16976 transitions. Word has length 231 [2019-09-08 04:54:57,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:54:57,334 INFO L475 AbstractCegarLoop]: Abstraction has 11272 states and 16976 transitions. [2019-09-08 04:54:57,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 04:54:57,334 INFO L276 IsEmpty]: Start isEmpty. Operand 11272 states and 16976 transitions. [2019-09-08 04:54:57,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 04:54:57,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:54:57,349 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:54:57,350 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:54:57,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:54:57,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1279402149, now seen corresponding path program 1 times [2019-09-08 04:54:57,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:54:57,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:54:57,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:57,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:57,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 04:54:57,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:54:57,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:54:57,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:54:57,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:54:57,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:54:57,591 INFO L87 Difference]: Start difference. First operand 11272 states and 16976 transitions. Second operand 10 states. [2019-09-08 04:54:57,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:54:57,931 INFO L93 Difference]: Finished difference Result 21783 states and 33528 transitions. [2019-09-08 04:54:57,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:54:57,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 235 [2019-09-08 04:54:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:54:57,992 INFO L225 Difference]: With dead ends: 21783 [2019-09-08 04:54:57,993 INFO L226 Difference]: Without dead ends: 11872 [2019-09-08 04:54:58,030 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 04:54:58,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11872 states. [2019-09-08 04:54:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11872 to 11392. [2019-09-08 04:54:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11392 states. [2019-09-08 04:54:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11392 states to 11392 states and 17086 transitions. [2019-09-08 04:54:58,735 INFO L78 Accepts]: Start accepts. Automaton has 11392 states and 17086 transitions. Word has length 235 [2019-09-08 04:54:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:54:58,736 INFO L475 AbstractCegarLoop]: Abstraction has 11392 states and 17086 transitions. [2019-09-08 04:54:58,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:54:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 11392 states and 17086 transitions. [2019-09-08 04:54:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 04:54:58,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:54:58,752 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:54:58,752 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:54:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:54:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1407868115, now seen corresponding path program 1 times [2019-09-08 04:54:58,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:54:58,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:54:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:58,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 04:54:58,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:54:58,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:54:58,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:59,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 2987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:54:59,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:54:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 04:54:59,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:54:59,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 04:54:59,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:54:59,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:54:59,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:54:59,434 INFO L87 Difference]: Start difference. First operand 11392 states and 17086 transitions. Second operand 12 states. [2019-09-08 04:55:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:55:01,341 INFO L93 Difference]: Finished difference Result 23106 states and 35411 transitions. [2019-09-08 04:55:01,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:55:01,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 240 [2019-09-08 04:55:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:55:01,393 INFO L225 Difference]: With dead ends: 23106 [2019-09-08 04:55:01,394 INFO L226 Difference]: Without dead ends: 11789 [2019-09-08 04:55:01,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:55:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11789 states. [2019-09-08 04:55:02,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11789 to 11592. [2019-09-08 04:55:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11592 states. [2019-09-08 04:55:02,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11592 states to 11592 states and 17403 transitions. [2019-09-08 04:55:02,066 INFO L78 Accepts]: Start accepts. Automaton has 11592 states and 17403 transitions. Word has length 240 [2019-09-08 04:55:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:55:02,066 INFO L475 AbstractCegarLoop]: Abstraction has 11592 states and 17403 transitions. [2019-09-08 04:55:02,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:55:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 11592 states and 17403 transitions. [2019-09-08 04:55:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 04:55:02,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:55:02,082 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 04:55:02,082 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:55:02,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:55:02,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1139335995, now seen corresponding path program 1 times [2019-09-08 04:55:02,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:55:02,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:55:02,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:02,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:55:02,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:55:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 04:55:02,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:55:02,324 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) [2019-09-08 04:55:02,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:55:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:55:02,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 2989 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:55:02,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:55:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 04:55:02,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:55:02,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2019-09-08 04:55:02,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:55:02,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:55:02,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:55:02,936 INFO L87 Difference]: Start difference. First operand 11592 states and 17403 transitions. Second operand 18 states. [2019-09-08 04:55:05,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:55:05,099 INFO L93 Difference]: Finished difference Result 23132 states and 35031 transitions. [2019-09-08 04:55:05,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 04:55:05,099 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 241 [2019-09-08 04:55:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:55:05,155 INFO L225 Difference]: With dead ends: 23132 [2019-09-08 04:55:05,156 INFO L226 Difference]: Without dead ends: 11620 [2019-09-08 04:55:05,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 04:55:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11620 states. [2019-09-08 04:55:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11620 to 11580. [2019-09-08 04:55:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11580 states. [2019-09-08 04:55:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11580 states to 11580 states and 17403 transitions. [2019-09-08 04:55:05,798 INFO L78 Accepts]: Start accepts. Automaton has 11580 states and 17403 transitions. Word has length 241 [2019-09-08 04:55:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:55:05,799 INFO L475 AbstractCegarLoop]: Abstraction has 11580 states and 17403 transitions. [2019-09-08 04:55:05,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:55:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 11580 states and 17403 transitions. [2019-09-08 04:55:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 04:55:05,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:55:05,821 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:55:05,821 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:55:05,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:55:05,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1952486845, now seen corresponding path program 1 times [2019-09-08 04:55:05,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:55:05,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:55:05,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:05,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:55:05,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:55:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 04:55:06,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:55:06,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:55:06,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:55:06,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:55:06,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:55:06,023 INFO L87 Difference]: Start difference. First operand 11580 states and 17403 transitions. Second operand 5 states. [2019-09-08 04:55:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:55:06,481 INFO L93 Difference]: Finished difference Result 20012 states and 29911 transitions. [2019-09-08 04:55:06,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:55:06,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2019-09-08 04:55:06,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:55:06,519 INFO L225 Difference]: With dead ends: 20012 [2019-09-08 04:55:06,519 INFO L226 Difference]: Without dead ends: 9334 [2019-09-08 04:55:06,545 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 04:55:06,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9334 states. [2019-09-08 04:55:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9334 to 9324. [2019-09-08 04:55:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9324 states. [2019-09-08 04:55:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9324 states to 9324 states and 13933 transitions. [2019-09-08 04:55:06,972 INFO L78 Accepts]: Start accepts. Automaton has 9324 states and 13933 transitions. Word has length 244 [2019-09-08 04:55:06,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:55:06,973 INFO L475 AbstractCegarLoop]: Abstraction has 9324 states and 13933 transitions. [2019-09-08 04:55:06,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:55:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 9324 states and 13933 transitions. [2019-09-08 04:55:06,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 04:55:06,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:55:06,986 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 04:55:06,986 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:55:06,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:55:06,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1295483621, now seen corresponding path program 1 times [2019-09-08 04:55:06,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:55:06,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:55:06,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:06,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:55:06,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:55:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 04:55:07,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:55:07,151 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 04:55:07,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:55:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:55:07,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 2991 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:55:07,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:55:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 04:55:07,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:55:07,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 04:55:07,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:55:07,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:55:07,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:55:07,685 INFO L87 Difference]: Start difference. First operand 9324 states and 13933 transitions. Second operand 11 states. [2019-09-08 04:55:10,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:55:10,410 INFO L93 Difference]: Finished difference Result 28009 states and 42492 transitions. [2019-09-08 04:55:10,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:55:10,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 243 [2019-09-08 04:55:10,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:55:10,491 INFO L225 Difference]: With dead ends: 28009 [2019-09-08 04:55:10,491 INFO L226 Difference]: Without dead ends: 18765 [2019-09-08 04:55:10,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-09-08 04:55:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18765 states. [2019-09-08 04:55:11,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18765 to 18403. [2019-09-08 04:55:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18403 states. [2019-09-08 04:55:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18403 states to 18403 states and 27500 transitions. [2019-09-08 04:55:11,418 INFO L78 Accepts]: Start accepts. Automaton has 18403 states and 27500 transitions. Word has length 243 [2019-09-08 04:55:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:55:11,418 INFO L475 AbstractCegarLoop]: Abstraction has 18403 states and 27500 transitions. [2019-09-08 04:55:11,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:55:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 18403 states and 27500 transitions. [2019-09-08 04:55:11,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 04:55:11,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:55:11,434 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 04:55:11,434 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:55:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:55:11,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1881109846, now seen corresponding path program 1 times [2019-09-08 04:55:11,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:55:11,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:55:11,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:11,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:55:11,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:55:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 04:55:11,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:55:11,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:55:11,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:55:11,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:55:11,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:55:11,622 INFO L87 Difference]: Start difference. First operand 18403 states and 27500 transitions. Second operand 7 states. [2019-09-08 04:55:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:55:15,358 INFO L93 Difference]: Finished difference Result 53639 states and 84676 transitions. [2019-09-08 04:55:15,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:55:15,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 245 [2019-09-08 04:55:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:55:15,532 INFO L225 Difference]: With dead ends: 53639 [2019-09-08 04:55:15,533 INFO L226 Difference]: Without dead ends: 36979 [2019-09-08 04:55:15,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:55:15,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36979 states. [2019-09-08 04:55:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36979 to 36564. [2019-09-08 04:55:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36564 states. [2019-09-08 04:55:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36564 states to 36564 states and 57376 transitions. [2019-09-08 04:55:18,207 INFO L78 Accepts]: Start accepts. Automaton has 36564 states and 57376 transitions. Word has length 245 [2019-09-08 04:55:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:55:18,208 INFO L475 AbstractCegarLoop]: Abstraction has 36564 states and 57376 transitions. [2019-09-08 04:55:18,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:55:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 36564 states and 57376 transitions. [2019-09-08 04:55:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 04:55:18,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:55:18,220 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:55:18,220 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:55:18,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:55:18,220 INFO L82 PathProgramCache]: Analyzing trace with hash -836187655, now seen corresponding path program 1 times [2019-09-08 04:55:18,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:55:18,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:55:18,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:18,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:55:18,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:55:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 04:55:18,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:55:18,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-08 04:55:18,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 04:55:18,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 04:55:18,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-09-08 04:55:18,814 INFO L87 Difference]: Start difference. First operand 36564 states and 57376 transitions. Second operand 28 states. [2019-09-08 04:55:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:55:20,684 INFO L93 Difference]: Finished difference Result 72722 states and 116099 transitions. [2019-09-08 04:55:20,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 04:55:20,685 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 246 [2019-09-08 04:55:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:55:20,823 INFO L225 Difference]: With dead ends: 72722 [2019-09-08 04:55:20,823 INFO L226 Difference]: Without dead ends: 37901 [2019-09-08 04:55:20,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 04:55:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37901 states. [2019-09-08 04:55:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37901 to 37836. [2019-09-08 04:55:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37836 states. [2019-09-08 04:55:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37836 states to 37836 states and 58892 transitions. [2019-09-08 04:55:24,269 INFO L78 Accepts]: Start accepts. Automaton has 37836 states and 58892 transitions. Word has length 246 [2019-09-08 04:55:24,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:55:24,270 INFO L475 AbstractCegarLoop]: Abstraction has 37836 states and 58892 transitions. [2019-09-08 04:55:24,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 04:55:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 37836 states and 58892 transitions. [2019-09-08 04:55:24,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 04:55:24,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:55:24,287 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 04:55:24,287 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:55:24,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:55:24,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1467797781, now seen corresponding path program 1 times [2019-09-08 04:55:24,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:55:24,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:55:24,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:24,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:55:24,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:55:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 04:55:24,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:55:24,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:55:24,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:55:24,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:55:24,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:55:24,487 INFO L87 Difference]: Start difference. First operand 37836 states and 58892 transitions. Second operand 8 states. [2019-09-08 04:55:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:55:34,091 INFO L93 Difference]: Finished difference Result 150807 states and 259178 transitions. [2019-09-08 04:55:34,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:55:34,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 277 [2019-09-08 04:55:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:55:34,456 INFO L225 Difference]: With dead ends: 150807 [2019-09-08 04:55:34,456 INFO L226 Difference]: Without dead ends: 114714 [2019-09-08 04:55:34,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:55:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114714 states. [2019-09-08 04:55:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114714 to 114508. [2019-09-08 04:55:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114508 states. [2019-09-08 04:55:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114508 states to 114508 states and 190794 transitions. [2019-09-08 04:55:41,500 INFO L78 Accepts]: Start accepts. Automaton has 114508 states and 190794 transitions. Word has length 277 [2019-09-08 04:55:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:55:41,500 INFO L475 AbstractCegarLoop]: Abstraction has 114508 states and 190794 transitions. [2019-09-08 04:55:41,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:55:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 114508 states and 190794 transitions. [2019-09-08 04:55:41,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-08 04:55:41,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:55:41,530 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 04:55:41,530 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:55:41,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:55:41,531 INFO L82 PathProgramCache]: Analyzing trace with hash 867685950, now seen corresponding path program 1 times [2019-09-08 04:55:41,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:55:41,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:55:41,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:41,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:55:41,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:55:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 04:55:41,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:55:41,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 04:55:41,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 04:55:41,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 04:55:41,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 04:55:41,957 INFO L87 Difference]: Start difference. First operand 114508 states and 190794 transitions. Second operand 24 states. [2019-09-08 04:55:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:55:48,673 INFO L93 Difference]: Finished difference Result 215545 states and 357543 transitions. [2019-09-08 04:55:48,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 04:55:48,673 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 278 [2019-09-08 04:55:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:55:49,035 INFO L225 Difference]: With dead ends: 215545 [2019-09-08 04:55:49,036 INFO L226 Difference]: Without dead ends: 105832 [2019-09-08 04:55:49,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 04:55:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105832 states. [2019-09-08 04:55:52,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105832 to 104237. [2019-09-08 04:55:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104237 states. [2019-09-08 04:55:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104237 states to 104237 states and 168045 transitions. [2019-09-08 04:55:53,195 INFO L78 Accepts]: Start accepts. Automaton has 104237 states and 168045 transitions. Word has length 278 [2019-09-08 04:55:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:55:53,196 INFO L475 AbstractCegarLoop]: Abstraction has 104237 states and 168045 transitions. [2019-09-08 04:55:53,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 04:55:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 104237 states and 168045 transitions. [2019-09-08 04:55:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-08 04:55:53,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:55:53,243 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 04:55:53,243 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:55:53,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:55:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1618146251, now seen corresponding path program 1 times [2019-09-08 04:55:53,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:55:53,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:55:53,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:53,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:55:53,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:55:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:55:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 04:55:53,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:55:53,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:55:53,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:55:53,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:55:53,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:55:53,445 INFO L87 Difference]: Start difference. First operand 104237 states and 168045 transitions. Second operand 8 states. [2019-09-08 04:56:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:56:02,186 INFO L93 Difference]: Finished difference Result 314871 states and 526148 transitions. [2019-09-08 04:56:02,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:56:02,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 287 [2019-09-08 04:56:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:56:02,999 INFO L225 Difference]: With dead ends: 314871 [2019-09-08 04:56:02,999 INFO L226 Difference]: Without dead ends: 214655 [2019-09-08 04:56:03,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:56:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214655 states. [2019-09-08 04:56:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214655 to 214100. [2019-09-08 04:56:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214100 states. [2019-09-08 04:56:20,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214100 states to 214100 states and 354156 transitions. [2019-09-08 04:56:20,760 INFO L78 Accepts]: Start accepts. Automaton has 214100 states and 354156 transitions. Word has length 287 [2019-09-08 04:56:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:56:20,760 INFO L475 AbstractCegarLoop]: Abstraction has 214100 states and 354156 transitions. [2019-09-08 04:56:20,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:56:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 214100 states and 354156 transitions. [2019-09-08 04:56:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-08 04:56:20,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:56:20,838 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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 04:56:20,838 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:56:20,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:56:20,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1931985860, now seen corresponding path program 1 times [2019-09-08 04:56:20,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:56:20,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:56:20,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:56:20,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:56:20,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:56:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:56:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 04:56:21,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:56:21,094 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 04:56:21,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:56:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:56:21,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 3143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:56:21,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:56:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 04:56:21,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:56:21,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4] total 17 [2019-09-08 04:56:21,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 04:56:21,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 04:56:21,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:56:21,667 INFO L87 Difference]: Start difference. First operand 214100 states and 354156 transitions. Second operand 17 states. [2019-09-08 04:56:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:56:38,401 INFO L93 Difference]: Finished difference Result 433838 states and 749676 transitions. [2019-09-08 04:56:38,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 04:56:38,402 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 288 [2019-09-08 04:56:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:56:39,786 INFO L225 Difference]: With dead ends: 433838 [2019-09-08 04:56:39,787 INFO L226 Difference]: Without dead ends: 221293 [2019-09-08 04:56:40,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 04:56:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221293 states. [2019-09-08 04:56:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221293 to 214190. [2019-09-08 04:56:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214190 states. [2019-09-08 04:56:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214190 states to 214190 states and 354301 transitions. [2019-09-08 04:56:50,116 INFO L78 Accepts]: Start accepts. Automaton has 214190 states and 354301 transitions. Word has length 288 [2019-09-08 04:56:50,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:56:50,116 INFO L475 AbstractCegarLoop]: Abstraction has 214190 states and 354301 transitions. [2019-09-08 04:56:50,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 04:56:50,117 INFO L276 IsEmpty]: Start isEmpty. Operand 214190 states and 354301 transitions. [2019-09-08 04:56:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 04:56:50,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:56:50,185 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:56:50,185 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:56:50,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:56:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash 144988026, now seen corresponding path program 1 times [2019-09-08 04:56:50,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:56:50,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:56:50,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:56:50,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:56:50,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:56:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:56:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 04:56:50,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:56:50,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:56:50,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:56:50,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:56:50,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:56:50,331 INFO L87 Difference]: Start difference. First operand 214190 states and 354301 transitions. Second operand 3 states. [2019-09-08 04:57:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:03,304 INFO L93 Difference]: Finished difference Result 428761 states and 709424 transitions. [2019-09-08 04:57:03,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:57:03,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-09-08 04:57:03,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:04,861 INFO L225 Difference]: With dead ends: 428761 [2019-09-08 04:57:04,861 INFO L226 Difference]: Without dead ends: 214684 [2019-09-08 04:57:05,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:57:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214684 states. [2019-09-08 04:57:19,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214684 to 214678. [2019-09-08 04:57:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214678 states. [2019-09-08 04:57:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214678 states to 214678 states and 355238 transitions. [2019-09-08 04:57:20,551 INFO L78 Accepts]: Start accepts. Automaton has 214678 states and 355238 transitions. Word has length 294 [2019-09-08 04:57:20,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:20,552 INFO L475 AbstractCegarLoop]: Abstraction has 214678 states and 355238 transitions. [2019-09-08 04:57:20,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:57:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 214678 states and 355238 transitions. [2019-09-08 04:57:20,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-08 04:57:20,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:20,624 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:20,625 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:20,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1794363753, now seen corresponding path program 1 times [2019-09-08 04:57:20,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:20,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:20,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:20,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:20,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 04:57:20,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:57:20,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:57:20,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:57:20,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:57:20,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:57:20,790 INFO L87 Difference]: Start difference. First operand 214678 states and 355238 transitions. Second operand 6 states. [2019-09-08 04:57:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:34,889 INFO L93 Difference]: Finished difference Result 429181 states and 710235 transitions. [2019-09-08 04:57:34,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:57:34,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 295 [2019-09-08 04:57:34,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:35,690 INFO L225 Difference]: With dead ends: 429181 [2019-09-08 04:57:35,690 INFO L226 Difference]: Without dead ends: 214684 [2019-09-08 04:57:36,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:57:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214684 states. [2019-09-08 04:57:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214684 to 214678. [2019-09-08 04:57:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214678 states. [2019-09-08 04:57:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214678 states to 214678 states and 355226 transitions. [2019-09-08 04:57:50,771 INFO L78 Accepts]: Start accepts. Automaton has 214678 states and 355226 transitions. Word has length 295 [2019-09-08 04:57:50,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:50,771 INFO L475 AbstractCegarLoop]: Abstraction has 214678 states and 355226 transitions. [2019-09-08 04:57:50,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:57:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 214678 states and 355226 transitions. [2019-09-08 04:57:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-08 04:57:50,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:50,838 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:50,839 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:50,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:50,839 INFO L82 PathProgramCache]: Analyzing trace with hash -824647430, now seen corresponding path program 1 times [2019-09-08 04:57:50,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:50,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:50,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:50,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:50,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 04:57:50,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:57:50,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:57:50,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:57:50,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:57:50,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:57:50,986 INFO L87 Difference]: Start difference. First operand 214678 states and 355226 transitions. Second operand 3 states. [2019-09-08 04:58:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:58:06,570 INFO L93 Difference]: Finished difference Result 430157 states and 712094 transitions. [2019-09-08 04:58:06,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:58:06,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2019-09-08 04:58:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:58:07,472 INFO L225 Difference]: With dead ends: 430157 [2019-09-08 04:58:07,472 INFO L226 Difference]: Without dead ends: 215598 [2019-09-08 04:58:08,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:58:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215598 states. [2019-09-08 04:58:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215598 to 215592. [2019-09-08 04:58:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215592 states. [2019-09-08 04:58:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215592 states to 215592 states and 356979 transitions. [2019-09-08 04:58:18,213 INFO L78 Accepts]: Start accepts. Automaton has 215592 states and 356979 transitions. Word has length 295 [2019-09-08 04:58:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:58:18,214 INFO L475 AbstractCegarLoop]: Abstraction has 215592 states and 356979 transitions. [2019-09-08 04:58:18,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:58:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 215592 states and 356979 transitions. [2019-09-08 04:58:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-08 04:58:18,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:58:18,287 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:58:18,287 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:58:18,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:58:18,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1017675353, now seen corresponding path program 1 times [2019-09-08 04:58:18,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:58:18,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:58:18,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:58:18,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:58:18,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:58:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:58:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 04:58:18,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:58:18,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:58:18,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:58:18,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:58:18,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:58:18,446 INFO L87 Difference]: Start difference. First operand 215592 states and 356979 transitions. Second operand 3 states. [2019-09-08 04:58:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:58:32,620 INFO L93 Difference]: Finished difference Result 432824 states and 717128 transitions. [2019-09-08 04:58:32,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:58:32,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-09-08 04:58:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:58:34,116 INFO L225 Difference]: With dead ends: 432824 [2019-09-08 04:58:34,117 INFO L226 Difference]: Without dead ends: 217362 [2019-09-08 04:58:34,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:58:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217362 states. [2019-09-08 04:58:47,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217362 to 217356. [2019-09-08 04:58:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217356 states. [2019-09-08 04:58:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217356 states to 217356 states and 360254 transitions. [2019-09-08 04:58:49,255 INFO L78 Accepts]: Start accepts. Automaton has 217356 states and 360254 transitions. Word has length 303 [2019-09-08 04:58:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:58:49,255 INFO L475 AbstractCegarLoop]: Abstraction has 217356 states and 360254 transitions. [2019-09-08 04:58:49,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:58:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 217356 states and 360254 transitions. [2019-09-08 04:58:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-08 04:58:49,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:58:49,329 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:58:49,329 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:58:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:58:49,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1742912090, now seen corresponding path program 1 times [2019-09-08 04:58:49,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:58:49,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:58:49,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:58:49,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:58:49,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:58:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:58:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 04:58:49,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:58:49,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:58:49,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:58:49,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:58:49,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:58:49,469 INFO L87 Difference]: Start difference. First operand 217356 states and 360254 transitions. Second operand 3 states. [2019-09-08 04:59:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:05,546 INFO L93 Difference]: Finished difference Result 437939 states and 726578 transitions. [2019-09-08 04:59:05,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:59:05,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-09-08 04:59:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:06,427 INFO L225 Difference]: With dead ends: 437939 [2019-09-08 04:59:06,428 INFO L226 Difference]: Without dead ends: 220734 [2019-09-08 04:59:07,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:59:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220734 states. [2019-09-08 04:59:15,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220734 to 220728. [2019-09-08 04:59:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220728 states. [2019-09-08 04:59:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220728 states to 220728 states and 366409 transitions. [2019-09-08 04:59:17,155 INFO L78 Accepts]: Start accepts. Automaton has 220728 states and 366409 transitions. Word has length 297 [2019-09-08 04:59:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:17,155 INFO L475 AbstractCegarLoop]: Abstraction has 220728 states and 366409 transitions. [2019-09-08 04:59:17,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:59:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand 220728 states and 366409 transitions. [2019-09-08 04:59:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-08 04:59:17,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:17,244 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:17,244 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:17,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:17,244 INFO L82 PathProgramCache]: Analyzing trace with hash 325627655, now seen corresponding path program 1 times [2019-09-08 04:59:17,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:17,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:17,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:17,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:17,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 04:59:17,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:17,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:59:17,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:59:17,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:59:17,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:59:17,387 INFO L87 Difference]: Start difference. First operand 220728 states and 366409 transitions. Second operand 3 states. [2019-09-08 04:59:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:32,711 INFO L93 Difference]: Finished difference Result 448115 states and 745295 transitions. [2019-09-08 04:59:32,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:59:32,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-09-08 04:59:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:33,558 INFO L225 Difference]: With dead ends: 448115 [2019-09-08 04:59:33,558 INFO L226 Difference]: Without dead ends: 227552 [2019-09-08 04:59:34,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:59:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227552 states. [2019-09-08 04:59:42,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227552 to 227546. [2019-09-08 04:59:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227546 states. [2019-09-08 04:59:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227546 states to 227546 states and 378890 transitions. [2019-09-08 04:59:43,505 INFO L78 Accepts]: Start accepts. Automaton has 227546 states and 378890 transitions. Word has length 305 [2019-09-08 04:59:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:43,506 INFO L475 AbstractCegarLoop]: Abstraction has 227546 states and 378890 transitions. [2019-09-08 04:59:43,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:59:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 227546 states and 378890 transitions. [2019-09-08 04:59:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 04:59:44,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:44,788 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:44,788 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:44,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:44,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1349665797, now seen corresponding path program 1 times [2019-09-08 04:59:44,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:44,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:44,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:44,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 04:59:44,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:44,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:59:44,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:59:44,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:59:44,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:59:44,926 INFO L87 Difference]: Start difference. First operand 227546 states and 378890 transitions. Second operand 3 states. [2019-09-08 04:59:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:59,816 INFO L93 Difference]: Finished difference Result 467601 states and 781193 transitions. [2019-09-08 04:59:59,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:59:59,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 04:59:59,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:00,655 INFO L225 Difference]: With dead ends: 467601 [2019-09-08 05:00:00,655 INFO L226 Difference]: Without dead ends: 240226 [2019-09-08 05:00:01,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240226 states. [2019-09-08 05:00:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240226 to 240220. [2019-09-08 05:00:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240220 states. [2019-09-08 05:00:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240220 states to 240220 states and 402123 transitions. [2019-09-08 05:00:12,018 INFO L78 Accepts]: Start accepts. Automaton has 240220 states and 402123 transitions. Word has length 306 [2019-09-08 05:00:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:12,019 INFO L475 AbstractCegarLoop]: Abstraction has 240220 states and 402123 transitions. [2019-09-08 05:00:12,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 240220 states and 402123 transitions. [2019-09-08 05:00:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 05:00:12,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:12,173 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:12,173 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:12,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:12,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1660443087, now seen corresponding path program 1 times [2019-09-08 05:00:12,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:12,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:12,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:12,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:12,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-08 05:00:12,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:12,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:00:12,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:00:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:00:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:00:12,326 INFO L87 Difference]: Start difference. First operand 240220 states and 402123 transitions. Second operand 5 states. [2019-09-08 05:00:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:27,593 INFO L93 Difference]: Finished difference Result 449929 states and 782163 transitions. [2019-09-08 05:00:27,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:00:27,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 313 [2019-09-08 05:00:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:28,570 INFO L225 Difference]: With dead ends: 449929 [2019-09-08 05:00:28,570 INFO L226 Difference]: Without dead ends: 238400 [2019-09-08 05:00:29,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:00:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238400 states. [2019-09-08 05:00:38,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238400 to 238304. [2019-09-08 05:00:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238304 states. [2019-09-08 05:00:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238304 states to 238304 states and 392363 transitions. [2019-09-08 05:00:39,376 INFO L78 Accepts]: Start accepts. Automaton has 238304 states and 392363 transitions. Word has length 313 [2019-09-08 05:00:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:39,377 INFO L475 AbstractCegarLoop]: Abstraction has 238304 states and 392363 transitions. [2019-09-08 05:00:39,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:00:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 238304 states and 392363 transitions. [2019-09-08 05:00:40,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 05:00:40,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:40,711 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:40,711 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:40,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:40,712 INFO L82 PathProgramCache]: Analyzing trace with hash 179215664, now seen corresponding path program 1 times [2019-09-08 05:00:40,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:40,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:40,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:40,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:40,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 05:00:41,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:00:41,079 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:00:41,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:41,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 3206 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:00:41,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:00:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 05:00:41,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:00:41,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5] total 26 [2019-09-08 05:00:41,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 05:00:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 05:00:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-09-08 05:00:41,625 INFO L87 Difference]: Start difference. First operand 238304 states and 392363 transitions. Second operand 26 states. [2019-09-08 05:01:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:01:00,909 INFO L93 Difference]: Finished difference Result 471382 states and 793381 transitions. [2019-09-08 05:01:00,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 05:01:00,910 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 306 [2019-09-08 05:01:00,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:01:02,046 INFO L225 Difference]: With dead ends: 471382 [2019-09-08 05:01:02,047 INFO L226 Difference]: Without dead ends: 260753 [2019-09-08 05:01:03,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=3321, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 05:01:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260753 states. [2019-09-08 05:01:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260753 to 250790. [2019-09-08 05:01:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250790 states. [2019-09-08 05:01:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250790 states to 250790 states and 416304 transitions. [2019-09-08 05:01:23,985 INFO L78 Accepts]: Start accepts. Automaton has 250790 states and 416304 transitions. Word has length 306 [2019-09-08 05:01:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:01:23,986 INFO L475 AbstractCegarLoop]: Abstraction has 250790 states and 416304 transitions. [2019-09-08 05:01:23,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 05:01:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 250790 states and 416304 transitions. [2019-09-08 05:01:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 05:01:24,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:01:24,203 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:01:24,203 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:01:24,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:01:24,204 INFO L82 PathProgramCache]: Analyzing trace with hash 135508803, now seen corresponding path program 1 times [2019-09-08 05:01:24,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:01:24,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:01:24,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:24,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:01:24,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:01:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 05:01:24,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:01:24,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:01:24,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:01:24,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:01:24,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:01:24,351 INFO L87 Difference]: Start difference. First operand 250790 states and 416304 transitions. Second operand 3 states. [2019-09-08 05:01:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:01:40,933 INFO L93 Difference]: Finished difference Result 524894 states and 876222 transitions. [2019-09-08 05:01:40,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:01:40,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 05:01:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:01:42,951 INFO L225 Difference]: With dead ends: 524894 [2019-09-08 05:01:42,951 INFO L226 Difference]: Without dead ends: 275109 [2019-09-08 05:01:43,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:01:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275109 states. [2019-09-08 05:02:06,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275109 to 275103. [2019-09-08 05:02:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275103 states. [2019-09-08 05:02:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275103 states to 275103 states and 460603 transitions. [2019-09-08 05:02:07,902 INFO L78 Accepts]: Start accepts. Automaton has 275103 states and 460603 transitions. Word has length 306 [2019-09-08 05:02:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:02:07,903 INFO L475 AbstractCegarLoop]: Abstraction has 275103 states and 460603 transitions. [2019-09-08 05:02:07,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:02:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 275103 states and 460603 transitions. [2019-09-08 05:02:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-08 05:02:08,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:02:08,146 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:02:08,146 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:02:08,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:02:08,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1450933402, now seen corresponding path program 1 times [2019-09-08 05:02:08,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:02:08,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:02:08,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:02:08,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:02:08,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:02:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:02:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:02:08,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:02:08,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:02:08,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:02:08,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:02:08,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:02:08,306 INFO L87 Difference]: Start difference. First operand 275103 states and 460603 transitions. Second operand 3 states. [2019-09-08 05:02:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:02:20,508 INFO L93 Difference]: Finished difference Result 595422 states and 1002066 transitions. [2019-09-08 05:02:20,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:02:20,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-09-08 05:02:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:02:21,667 INFO L225 Difference]: With dead ends: 595422 [2019-09-08 05:02:21,667 INFO L226 Difference]: Without dead ends: 321537 [2019-09-08 05:02:22,182 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:02:22,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321537 states. [2019-09-08 05:02:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321537 to 321531. [2019-09-08 05:02:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321531 states. [2019-09-08 05:02:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321531 states to 321531 states and 541735 transitions. [2019-09-08 05:02:49,187 INFO L78 Accepts]: Start accepts. Automaton has 321531 states and 541735 transitions. Word has length 301 [2019-09-08 05:02:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:02:49,187 INFO L475 AbstractCegarLoop]: Abstraction has 321531 states and 541735 transitions. [2019-09-08 05:02:49,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:02:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 321531 states and 541735 transitions. [2019-09-08 05:02:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 05:02:49,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:02:49,624 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:02:49,624 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:02:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:02:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash 954889654, now seen corresponding path program 1 times [2019-09-08 05:02:49,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:02:49,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:02:49,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:02:49,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:02:49,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:02:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:02:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:02:49,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:02:49,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:02:49,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:02:49,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:02:49,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:02:49,781 INFO L87 Difference]: Start difference. First operand 321531 states and 541735 transitions. Second operand 3 states. [2019-09-08 05:03:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:03:16,566 INFO L93 Difference]: Finished difference Result 729129 states and 1239420 transitions. [2019-09-08 05:03:16,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:03:16,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-08 05:03:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:03:18,882 INFO L225 Difference]: With dead ends: 729129 [2019-09-08 05:03:18,882 INFO L226 Difference]: Without dead ends: 409224 [2019-09-08 05:03:19,461 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:03:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409224 states. [2019-09-08 05:03:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409224 to 409218. [2019-09-08 05:03:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409218 states. [2019-09-08 05:03:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409218 states to 409218 states and 697015 transitions. [2019-09-08 05:03:56,725 INFO L78 Accepts]: Start accepts. Automaton has 409218 states and 697015 transitions. Word has length 302 [2019-09-08 05:03:56,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:03:56,726 INFO L475 AbstractCegarLoop]: Abstraction has 409218 states and 697015 transitions. [2019-09-08 05:03:56,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:03:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 409218 states and 697015 transitions. [2019-09-08 05:03:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-08 05:03:58,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:03:58,635 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:03:58,635 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:03:58,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:03:58,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2087208378, now seen corresponding path program 1 times [2019-09-08 05:03:58,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:03:58,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:03:58,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:03:58,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:03:58,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:03:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:03:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:03:58,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:03:58,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:03:58,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:03:58,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:03:58,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:03:58,770 INFO L87 Difference]: Start difference. First operand 409218 states and 697015 transitions. Second operand 3 states.